NEWS
author wenzelm
Sat, 28 Jul 2007 22:17:46 +0200
changeset 24032 b3d7eb6f535f
parent 23977 5a3ec03c825b
child 24086 21900a460ba4
permissions -rw-r--r--
* Isar: command 'declaration'; * Isar: proper interfaces for simplification procedures; * Isar: an extra pair of brackets around attribute declarations abbreviates a theorem reference involving an internal dummy fact;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
5363
0cf15843b82f isatool install;
wenzelm
parents: 5332
diff changeset
     1
Isabelle NEWS -- history user-relevant changes
0cf15843b82f isatool install;
wenzelm
parents: 5332
diff changeset
     2
==============================================
2553
ed941505cab7 Isabelle NEWS -- history of user-visible changes;
wenzelm
parents:
diff changeset
     3
20807
wenzelm
parents: 20716
diff changeset
     4
New in this Isabelle version
17754
58a306d9f736 * Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents: 17725
diff changeset
     5
----------------------------
58a306d9f736 * Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents: 17725
diff changeset
     6
58a306d9f736 * Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents: 17725
diff changeset
     7
*** General ***
58a306d9f736 * Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents: 17725
diff changeset
     8
22826
0f4c501a691e explicit treatment of legacy_features;
wenzelm
parents: 22799
diff changeset
     9
* More uniform information about legacy features, notably a
0f4c501a691e explicit treatment of legacy_features;
wenzelm
parents: 22799
diff changeset
    10
warning/error of "Legacy feature: ...", depending on the state of the
23367
wenzelm
parents: 23300
diff changeset
    11
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
wenzelm
parents: 23300
diff changeset
    12
legacy features will disappear eventually.
22826
0f4c501a691e explicit treatment of legacy_features;
wenzelm
parents: 22799
diff changeset
    13
17918
93e26302733e * Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents: 17890
diff changeset
    14
* Theory syntax: the header format ``theory A = B + C:'' has been
93e26302733e * Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents: 17890
diff changeset
    15
discontinued in favour of ``theory A imports B C begin''.  Use isatool
93e26302733e * Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents: 17890
diff changeset
    16
fixheaders to convert existing theory files.  INCOMPATIBILITY.
93e26302733e * Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents: 17890
diff changeset
    17
93e26302733e * Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents: 17890
diff changeset
    18
* Theory syntax: the old non-Isar theory file format has been
93e26302733e * Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents: 17890
diff changeset
    19
discontinued altogether.  Note that ML proof scripts may still be used
93e26302733e * Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents: 17890
diff changeset
    20
with Isar theories; migration is usually quite simple with the ML
93e26302733e * Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents: 17890
diff changeset
    21
function use_legacy_bindings.  INCOMPATIBILITY.
93e26302733e * Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents: 17890
diff changeset
    22
22871
wenzelm
parents: 22863
diff changeset
    23
* Theory syntax: some popular names (e.g. 'class', 'declaration',
wenzelm
parents: 22863
diff changeset
    24
'fun', 'help', 'if') are now keywords.  INCOMPATIBILITY, use double
wenzelm
parents: 22863
diff changeset
    25
quotes.
19814
faa698d46686 * Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents: 19783
diff changeset
    26
23888
babe337cce2d * Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents: 23881
diff changeset
    27
* Theory loader: be more serious about observing the static theory
babe337cce2d * Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents: 23881
diff changeset
    28
header specifications (including optional directories), but not the
babe337cce2d * Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents: 23881
diff changeset
    29
accidental file locations of previously successful loads.  Potential
babe337cce2d * Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents: 23881
diff changeset
    30
INCOMPATIBILITY, may need to refine theory headers.
babe337cce2d * Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents: 23881
diff changeset
    31
babe337cce2d * Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents: 23881
diff changeset
    32
* Theory loader: optional support for content-based file
babe337cce2d * Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents: 23881
diff changeset
    33
identification, instead of the traditional scheme of full physical
23889
wenzelm
parents: 23888
diff changeset
    34
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
23888
babe337cce2d * Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents: 23881
diff changeset
    35
(cf. the system manual).  The new scheme allows to work with
babe337cce2d * Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents: 23881
diff changeset
    36
non-finished theories in persistent session images, such that source
babe337cce2d * Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents: 23881
diff changeset
    37
files may be moved later on without requiring reloads.
babe337cce2d * Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents: 23881
diff changeset
    38
17981
2602be0d99ae * Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents: 17918
diff changeset
    39
* Legacy goal package: reduced interface to the bare minimum required
2602be0d99ae * Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents: 17918
diff changeset
    40
to keep existing proof scripts running.  Most other user-level
2602be0d99ae * Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents: 17918
diff changeset
    41
functions are now part of the OldGoals structure, which is *not* open
2602be0d99ae * Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents: 17918
diff changeset
    42
by default (consider isatool expandshort before open OldGoals).
2602be0d99ae * Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents: 17918
diff changeset
    43
Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2602be0d99ae * Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents: 17918
diff changeset
    44
these tend to cause confusion about the actual goal (!) context being
2602be0d99ae * Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents: 17918
diff changeset
    45
used here, which is not necessarily the same as the_context().
17918
93e26302733e * Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents: 17890
diff changeset
    46
23379
d0e3f790bd73 updated 'find_theorems' -- moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents: 23377
diff changeset
    47
* Command 'find_theorems': supports "*" wild-card in "name:"
d0e3f790bd73 updated 'find_theorems' -- moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents: 23377
diff changeset
    48
criterion; "with_dups" option.  Certain ProofGeneral versions might
d0e3f790bd73 updated 'find_theorems' -- moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents: 23377
diff changeset
    49
support a specific search form (see ProofGeneral/CHANGES).
22965
b81bbe298406 ProofGeneral: Find Theorems search form
webertj
parents: 22921
diff changeset
    50
20370
217aada4f795 * ProofContext.prems_limit is now -1 by default;
wenzelm
parents: 20348
diff changeset
    51
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
217aada4f795 * ProofContext.prems_limit is now -1 by default;
wenzelm
parents: 20348
diff changeset
    52
by default, which means that "prems" (and also "fixed variables") are
217aada4f795 * ProofContext.prems_limit is now -1 by default;
wenzelm
parents: 20348
diff changeset
    53
suppressed from proof state output.  Note that the ProofGeneral
217aada4f795 * ProofContext.prems_limit is now -1 by default;
wenzelm
parents: 20348
diff changeset
    54
settings mechanism allows to change and save options persistently, but
217aada4f795 * ProofContext.prems_limit is now -1 by default;
wenzelm
parents: 20348
diff changeset
    55
older versions of Isabelle will fail to start up if a negative prems
217aada4f795 * ProofContext.prems_limit is now -1 by default;
wenzelm
parents: 20348
diff changeset
    56
limit is imposed.
217aada4f795 * ProofContext.prems_limit is now -1 by default;
wenzelm
parents: 20348
diff changeset
    57
21308
73883a528b26 * Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents: 21265
diff changeset
    58
* Local theory targets may be specified by non-nested blocks of
73883a528b26 * Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents: 21265
diff changeset
    59
``context/locale/class ... begin'' followed by ``end''.  The body may
73883a528b26 * Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents: 21265
diff changeset
    60
contain definitions, theorems etc., including any derived mechanism
73883a528b26 * Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents: 21265
diff changeset
    61
that has been implemented on top of these primitives.  This concept
73883a528b26 * Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents: 21265
diff changeset
    62
generalizes the existing ``theorem (in ...)'' towards more versatility
73883a528b26 * Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents: 21265
diff changeset
    63
and scalability.
73883a528b26 * Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents: 21265
diff changeset
    64
21960
0574f192b78a * Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents: 21896
diff changeset
    65
* Proof General interface: proper undo of final 'end' command;
0574f192b78a * Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents: 21896
diff changeset
    66
discontinued Isabelle/classic mode (ML proof scripts).
0574f192b78a * Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents: 21896
diff changeset
    67
17754
58a306d9f736 * Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents: 17725
diff changeset
    68
17865
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
    69
*** Document preparation ***
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
    70
21717
410ca6910f6f added antiquotation abbrev;
wenzelm
parents: 21647
diff changeset
    71
* Added antiquotation @{theory name} which prints the given name,
410ca6910f6f added antiquotation abbrev;
wenzelm
parents: 21647
diff changeset
    72
after checking that it refers to a valid ancestor theory in the
410ca6910f6f added antiquotation abbrev;
wenzelm
parents: 21647
diff changeset
    73
current context.
21339
b59f7cca0b0c added antiquotation theory
haftmann
parents: 21320
diff changeset
    74
17869
wenzelm
parents: 17865
diff changeset
    75
* Added antiquotations @{ML_type text} and @{ML_struct text} which
wenzelm
parents: 17865
diff changeset
    76
check the given source text as ML type/structure, printing verbatim.
17865
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
    77
21717
410ca6910f6f added antiquotation abbrev;
wenzelm
parents: 21647
diff changeset
    78
* Added antiquotation @{abbrev "c args"} which prints the abbreviation
410ca6910f6f added antiquotation abbrev;
wenzelm
parents: 21647
diff changeset
    79
"c args == rhs" given in the current context.  (Any number of
21735
0c65e072f4be added print_abbrevs;
wenzelm
parents: 21717
diff changeset
    80
arguments may be given on the LHS.)
21717
410ca6910f6f added antiquotation abbrev;
wenzelm
parents: 21647
diff changeset
    81
410ca6910f6f added antiquotation abbrev;
wenzelm
parents: 21647
diff changeset
    82
17865
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
    83
17779
407bea05c2da added dummy variable binding;
wenzelm
parents: 17754
diff changeset
    84
*** Pure ***
407bea05c2da added dummy variable binding;
wenzelm
parents: 17754
diff changeset
    85
22921
475ff421a6a3 consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents: 22871
diff changeset
    86
* code generator: consts in 'consts_code' Isar commands are now referred
475ff421a6a3 consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents: 22871
diff changeset
    87
  to by usual term syntax (including optional type annotations).
475ff421a6a3 consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents: 22871
diff changeset
    88
22735
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
    89
* code generator: 
22921
475ff421a6a3 consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents: 22871
diff changeset
    90
  - Isar 'definition's, 'constdef's and primitive instance definitions are added
475ff421a6a3 consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents: 22871
diff changeset
    91
    explicitly to the table of defining equations
22754
9947ae4792a0 clarifed
haftmann
parents: 22735
diff changeset
    92
  - primitive definitions are not used as defining equations by default any longer
22735
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
    93
  - defining equations are now definitly restricted to meta "==" and object
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
    94
        equality "="
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
    95
  - HOL theories have been adopted accordingly
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
    96
20807
wenzelm
parents: 20716
diff changeset
    97
* class_package.ML offers a combination of axclasses and locales to
22921
475ff421a6a3 consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents: 22871
diff changeset
    98
achieve Haskell-like type classes in Isabelle.  See
20807
wenzelm
parents: 20716
diff changeset
    99
HOL/ex/Classpackage.thy for examples.
wenzelm
parents: 20716
diff changeset
   100
wenzelm
parents: 20716
diff changeset
   101
* Yet another code generator framework allows to generate executable
22921
475ff421a6a3 consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents: 22871
diff changeset
   102
code for ML and Haskell (including "class"es).  A short usage sketch:
20188
8b22026445af added notes on class_package.ML and codegen_package.ML
haftmann
parents: 20169
diff changeset
   103
8b22026445af added notes on class_package.ML and codegen_package.ML
haftmann
parents: 20169
diff changeset
   104
    internal compilation:
23850
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   105
        code_gen <list of constants (term syntax)> in SML
20453
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   106
    writing SML code to a file:
23850
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   107
        code_gen <list of constants (term syntax)> in SML <filename>
22735
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
   108
    writing OCaml code to a file:
23850
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   109
        code_gen <list of constants (term syntax)> in OCaml <filename>
20188
8b22026445af added notes on class_package.ML and codegen_package.ML
haftmann
parents: 20169
diff changeset
   110
    writing Haskell code to a bunch of files:
23850
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   111
        code_gen <list of constants (term syntax)> in Haskell <filename>
20453
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   112
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   113
Reasonable default setup of framework in HOL/Main.
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   114
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   115
Theorem attributs for selecting and transforming function equations theorems:
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   116
22845
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22826
diff changeset
   117
    [code fun]:        select a theorem as function equation for a specific constant
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22826
diff changeset
   118
    [code fun del]:    deselect a theorem as function equation for a specific constant
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22826
diff changeset
   119
    [code inline]:     select an equation theorem for unfolding (inlining) in place
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22826
diff changeset
   120
    [code inline del]: deselect an equation theorem for unfolding (inlining) in place
20453
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   121
22735
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
   122
User-defined serializations (target in {SML, OCaml, Haskell}):
20453
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   123
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   124
    code_const <and-list of constants (term syntax)>
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   125
      {(target) <and-list of const target syntax>}+
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   126
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   127
    code_type <and-list of type constructors>
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   128
      {(target) <and-list of type target syntax>}+
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   129
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   130
    code_instance <and-list of instances>
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   131
      {(target)}+
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   132
        where instance ::= <type constructor> :: <class>
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   133
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   134
    code_class <and_list of classes>
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   135
      {(target) <and-list of class target syntax>}+
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   136
        where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
855f07fabd76 final syntax for some Isar code generator keywords
haftmann
parents: 20375
diff changeset
   137
22735
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
   138
code_instance and code_class only apply to target Haskell.
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
   139
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
   140
See HOL theories and HOL/ex/Codegenerator*.thy for usage examples.
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
   141
Doc/Isar/Advanced/Codegen/ provides a tutorial.
20188
8b22026445af added notes on class_package.ML and codegen_package.ML
haftmann
parents: 20169
diff changeset
   142
19254
efaf5d47049e Pure: no_translations;
wenzelm
parents: 19252
diff changeset
   143
* Command 'no_translations' removes translation rules from theory
efaf5d47049e Pure: no_translations;
wenzelm
parents: 19252
diff changeset
   144
syntax.
efaf5d47049e Pure: no_translations;
wenzelm
parents: 19252
diff changeset
   145
19625
285771cec083 * Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents: 19587
diff changeset
   146
* Overloaded definitions are now actually checked for acyclic
19714
wenzelm
parents: 19711
diff changeset
   147
dependencies.  The overloading scheme is slightly more general than
wenzelm
parents: 19711
diff changeset
   148
that of Haskell98, although Isabelle does not demand an exact
wenzelm
parents: 19711
diff changeset
   149
correspondence to type class and instance declarations.
wenzelm
parents: 19711
diff changeset
   150
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
wenzelm
parents: 19711
diff changeset
   151
exotic versions of overloading -- at the discretion of the user!
19711
2401b1a3087f Pure: update on overloaded defs;
wenzelm
parents: 19682
diff changeset
   152
2401b1a3087f Pure: update on overloaded defs;
wenzelm
parents: 19682
diff changeset
   153
Polymorphic constants are represented via type arguments, i.e. the
2401b1a3087f Pure: update on overloaded defs;
wenzelm
parents: 19682
diff changeset
   154
instantiation that matches an instance against the most general
2401b1a3087f Pure: update on overloaded defs;
wenzelm
parents: 19682
diff changeset
   155
declaration given in the signature.  For example, with the declaration
2401b1a3087f Pure: update on overloaded defs;
wenzelm
parents: 19682
diff changeset
   156
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2401b1a3087f Pure: update on overloaded defs;
wenzelm
parents: 19682
diff changeset
   157
as c(nat).  Overloading is essentially simultaneous structural
2401b1a3087f Pure: update on overloaded defs;
wenzelm
parents: 19682
diff changeset
   158
recursion over such type arguments.  Incomplete specification patterns
19714
wenzelm
parents: 19711
diff changeset
   159
impose global constraints on all occurrences, e.g. c('a * 'a) on the
19715
wenzelm
parents: 19714
diff changeset
   160
LHS means that more general c('a * 'b) will be disallowed on any RHS.
19714
wenzelm
parents: 19711
diff changeset
   161
Command 'print_theory' outputs the normalized system of recursive
wenzelm
parents: 19711
diff changeset
   162
equations, see section "definitions".
19625
285771cec083 * Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents: 19587
diff changeset
   163
24032
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   164
* Isar: command 'declaration' augments a local theory by generic
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   165
declaration functions written in ML.  This enables arbitrary content
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   166
being added to the context, depending on a morphism that tells the
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   167
difference of the original declaration context wrt. the application
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   168
context encountered later on.
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   169
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   170
* Isar: proper interfaces for simplification procedures.  Command
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   171
'simproc_setup' declares named simprocs (with match patterns, and body
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   172
text in ML).  Attribute "simproc" adds/deletes simprocs in the current
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   173
context.  ML antiquotation @{simproc name} retrieves named simprocs.
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   174
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   175
* Isar: an extra pair of brackets around attribute declarations
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   176
abbreviates a theorem reference involving an internal dummy fact,
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   177
which will be ignored later --- only the effect of the attribute on
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   178
the background context will persist.  This form of in-place
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   179
declarations is particularly useful with commands like 'declare' and
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   180
'using', for example ``have A using [[simproc a]] by simp''.
b3d7eb6f535f * Isar: command 'declaration';
wenzelm
parents: 23977
diff changeset
   181
23369
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   182
* Isar: method "assumption" (and implicit closing of subproofs) now
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   183
takes simple non-atomic goal assumptions into account: after applying
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   184
an assumption as a rule the resulting subgoals are solved by atomic
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   185
assumption steps.  This is particularly useful to finish 'obtain'
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   186
goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   187
without referring to the original premise "!!x. P x ==> thesis" in the
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   188
Isar proof context.  POTENTIAL INCOMPATIBILITY: method "assumption" is
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   189
more permissive.
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   190
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   191
* Isar: implicit use of prems from the Isar proof context is
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   192
considered a legacy feature.  Common applications like ``have A .''
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   193
may be replaced by ``have A by fact'' or ``note `A`''.  In general,
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   194
referencing facts explicitly here improves readability and
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   195
maintainability of proof texts.
227c51012cdb * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents: 23367
diff changeset
   196
17865
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
   197
* Isar: improper proof element 'guess' is like 'obtain', but derives
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
   198
the obtained context from the course of reasoning!  For example:
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
   199
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
   200
  assume "EX x y. A x & B y"   -- "any previous fact"
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
   201
  then guess x and y by clarify
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
   202
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
   203
This technique is potentially adventurous, depending on the facts and
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
   204
proof tools being involved here.
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
   205
18020
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   206
* Isar: known facts from the proof context may be specified as literal
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   207
propositions, using ASCII back-quote syntax.  This works wherever
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   208
named facts used to be allowed so far, in proof commands, proof
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   209
methods, attributes etc.  Literal facts are retrieved from the context
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   210
according to unification of type and term parameters.  For example,
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   211
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   212
theorems in the current context, then these are valid literal facts:
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   213
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   214
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   215
There is also a proof method "fact" which does the same composition
18044
wenzelm
parents: 18020
diff changeset
   216
for explicit goal states, e.g. the following proof texts coincide with
wenzelm
parents: 18020
diff changeset
   217
certain special cases of literal facts:
18020
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   218
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   219
  have "A" by fact                 ==  note `A`
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   220
  have "A ==> B" by fact           ==  note `A ==> B`
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   221
  have "!!x. P x ==> Q x" by fact  ==  note `!!x. P x ==> Q x`
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   222
  have "P a ==> Q a" by fact       ==  note `P a ==> Q a`
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
   223
20118
0c1ec587a5a8 * Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents: 20090
diff changeset
   224
* Isar: ":" (colon) is no longer a symbolic identifier character in
0c1ec587a5a8 * Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents: 20090
diff changeset
   225
outer syntax.  Thus symbolic identifiers may be used without
0c1ec587a5a8 * Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents: 20090
diff changeset
   226
additional white space in declarations like this: ``assume *: A''.
0c1ec587a5a8 * Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents: 20090
diff changeset
   227
20013
57505678692d Isar: 'print_facts' prints all local facts;
wenzelm
parents: 19984
diff changeset
   228
* Isar: 'print_facts' prints all local facts of the current context,
57505678692d Isar: 'print_facts' prints all local facts;
wenzelm
parents: 19984
diff changeset
   229
both named and unnamed ones.
57505678692d Isar: 'print_facts' prints all local facts;
wenzelm
parents: 19984
diff changeset
   230
18308
f18a54840629 simulaneous 'def';
wenzelm
parents: 18267
diff changeset
   231
* Isar: 'def' now admits simultaneous definitions, e.g.:
f18a54840629 simulaneous 'def';
wenzelm
parents: 18267
diff changeset
   232
f18a54840629 simulaneous 'def';
wenzelm
parents: 18267
diff changeset
   233
  def x == "t" and y == "u"
f18a54840629 simulaneous 'def';
wenzelm
parents: 18267
diff changeset
   234
18540
7b6f57406b1b * Pure/Isar: new command 'unfolding';
wenzelm
parents: 18536
diff changeset
   235
* Isar: added command 'unfolding', which is structurally similar to
7b6f57406b1b * Pure/Isar: new command 'unfolding';
wenzelm
parents: 18536
diff changeset
   236
'using', but affects both the goal state and facts by unfolding given
18815
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
   237
rewrite rules.  Thus many occurrences of the 'unfold' method or
18540
7b6f57406b1b * Pure/Isar: new command 'unfolding';
wenzelm
parents: 18536
diff changeset
   238
'unfolded' attribute may be replaced by first-class proof text.
7b6f57406b1b * Pure/Isar: new command 'unfolding';
wenzelm
parents: 18536
diff changeset
   239
18815
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
   240
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
   241
and command 'unfolding' now all support object-level equalities
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
   242
(potentially conditional).  The underlying notion of rewrite rule is
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
   243
analogous to the 'rule_format' attribute, but *not* that of the
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
   244
Simplifier (which is usually more generous).
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
   245
19220
05b00acff957 Isar/method: goal restriction;
wenzelm
parents: 19211
diff changeset
   246
* Isar: the goal restriction operator [N] (default N = 1) evaluates a
05b00acff957 Isar/method: goal restriction;
wenzelm
parents: 19211
diff changeset
   247
method expression within a sandbox consisting of the first N
19240
wenzelm
parents: 19233
diff changeset
   248
sub-goals, which need to exist.  For example, ``simp_all [3]''
wenzelm
parents: 19233
diff changeset
   249
simplifies the first three sub-goals, while (rule foo, simp_all)[]
wenzelm
parents: 19233
diff changeset
   250
simplifies all new goals that emerge from applying rule foo to the
wenzelm
parents: 19233
diff changeset
   251
originally first one.
19220
05b00acff957 Isar/method: goal restriction;
wenzelm
parents: 19211
diff changeset
   252
19814
faa698d46686 * Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents: 19783
diff changeset
   253
* Isar: schematic goals are no longer restricted to higher-order
faa698d46686 * Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents: 19783
diff changeset
   254
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
faa698d46686 * Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents: 19783
diff changeset
   255
expected.
faa698d46686 * Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents: 19783
diff changeset
   256
18901
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   257
* Isar: the conclusion of a long theorem statement is now either
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   258
'shows' (a simultaneous conjunction, as before), or 'obtains'
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   259
(essentially a disjunction of cases with local parameters and
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   260
assumptions).  The latter allows to express general elimination rules
18910
wenzelm
parents: 18901
diff changeset
   261
adequately; in this notation common elimination rules look like this:
18901
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   262
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   263
  lemma exE:    -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   264
    assumes "EX x. P x"
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   265
    obtains x where "P x"
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   266
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   267
  lemma conjE:  -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   268
    assumes "A & B"
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   269
    obtains A and B
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   270
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   271
  lemma disjE:  -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   272
    assumes "A | B"
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   273
    obtains
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   274
      A
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   275
    | B
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   276
18910
wenzelm
parents: 18901
diff changeset
   277
The subsequent classical rules even refer to the formal "thesis"
18901
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   278
explicitly:
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   279
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   280
  lemma classical:     -- "(~ thesis ==> thesis) ==> thesis"
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   281
    obtains "~ thesis"
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   282
18910
wenzelm
parents: 18901
diff changeset
   283
  lemma Peirce's_Law:  -- "((thesis ==> something) ==> thesis) ==> thesis"
wenzelm
parents: 18901
diff changeset
   284
    obtains "thesis ==> something"
18901
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   285
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   286
The actual proof of an 'obtains' statement is analogous to that of the
18910
wenzelm
parents: 18901
diff changeset
   287
Isar proof element 'obtain', only that there may be several cases.
wenzelm
parents: 18901
diff changeset
   288
Optional case names may be specified in parentheses; these will be
wenzelm
parents: 18901
diff changeset
   289
available both in the present proof and as annotations in the
wenzelm
parents: 18901
diff changeset
   290
resulting rule, for later use with the 'cases' method (cf. attribute
wenzelm
parents: 18901
diff changeset
   291
case_names).
18901
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   292
21447
379f130843f7 * Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents: 21406
diff changeset
   293
* Isar: the assumptions of a long theorem statement are available as
379f130843f7 * Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents: 21406
diff changeset
   294
"assms" fact in the proof context.  This is more appropriate than the
379f130843f7 * Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents: 21406
diff changeset
   295
(historical) "prems", which refers to all assumptions of the current
379f130843f7 * Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents: 21406
diff changeset
   296
context, including those from the target locale, proof body etc.
379f130843f7 * Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents: 21406
diff changeset
   297
19263
a86d09815dac print_statement;
wenzelm
parents: 19254
diff changeset
   298
* Isar: 'print_statement' prints theorems from the current theory or
a86d09815dac print_statement;
wenzelm
parents: 19254
diff changeset
   299
proof context in long statement form, according to the syntax of a
a86d09815dac print_statement;
wenzelm
parents: 19254
diff changeset
   300
top-level lemma.
a86d09815dac print_statement;
wenzelm
parents: 19254
diff changeset
   301
18901
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   302
* Isar: 'obtain' takes an optional case name for the local context
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   303
introduction rule (default "that").
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   304
19587
eb063e7932d7 * Isar: removed obsolete 'concl is' patterns.
wenzelm
parents: 19572
diff changeset
   305
* Isar: removed obsolete 'concl is' patterns.  INCOMPATIBILITY, use
eb063e7932d7 * Isar: removed obsolete 'concl is' patterns.
wenzelm
parents: 19572
diff changeset
   306
explicit (is "_ ==> ?foo") in the rare cases where this still happens
eb063e7932d7 * Isar: removed obsolete 'concl is' patterns.
wenzelm
parents: 19572
diff changeset
   307
to occur.
eb063e7932d7 * Isar: removed obsolete 'concl is' patterns.
wenzelm
parents: 19572
diff changeset
   308
19682
c8c301eb965a * Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents: 19665
diff changeset
   309
* Pure: syntax "CONST name" produces a fully internalized constant
c8c301eb965a * Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents: 19665
diff changeset
   310
according to the current context.  This is particularly useful for
c8c301eb965a * Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents: 19665
diff changeset
   311
syntax translations that should refer to internal constant
c8c301eb965a * Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents: 19665
diff changeset
   312
representations independently of name spaces.
c8c301eb965a * Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents: 19665
diff changeset
   313
21537
45b3a85ee548 * Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents: 21471
diff changeset
   314
* Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
45b3a85ee548 * Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents: 21471
diff changeset
   315
instead of "FOO ". This allows multiple binder declarations to coexist
45b3a85ee548 * Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents: 21471
diff changeset
   316
in the same context.  INCOMPATIBILITY.
45b3a85ee548 * Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents: 21471
diff changeset
   317
21209
dbb8decc36bc 'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents: 21200
diff changeset
   318
* Isar/locales: 'notation' provides a robust interface to the 'syntax'
dbb8decc36bc 'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents: 21200
diff changeset
   319
primitive that also works in a locale context (both for constants and
dbb8decc36bc 'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents: 21200
diff changeset
   320
fixed variables).  Type declaration and internal syntactic
dbb8decc36bc 'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents: 21200
diff changeset
   321
representation of given constants retrieved from the context.
19682
c8c301eb965a * Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents: 19665
diff changeset
   322
19665
8885951e9c2d * Isar/locale: 'const_syntax';
wenzelm
parents: 19653
diff changeset
   323
* Isar/locales: new derived specification elements 'axiomatization',
8885951e9c2d * Isar/locale: 'const_syntax';
wenzelm
parents: 19653
diff changeset
   324
'definition', 'abbreviation', which support type-inference, admit
19083
wenzelm
parents: 19081
diff changeset
   325
object-level specifications (equality, equivalence).  See also the
wenzelm
parents: 19081
diff changeset
   326
isar-ref manual.  Examples:
19081
085b5badb8de * Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents: 19034
diff changeset
   327
19665
8885951e9c2d * Isar/locale: 'const_syntax';
wenzelm
parents: 19653
diff changeset
   328
  axiomatization
21595
wenzelm
parents: 21545
diff changeset
   329
    eq  (infix "===" 50) where
wenzelm
parents: 21545
diff changeset
   330
    eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
wenzelm
parents: 21545
diff changeset
   331
wenzelm
parents: 21545
diff changeset
   332
  definition "f x y = x + y + 1"
wenzelm
parents: 21545
diff changeset
   333
  definition g where "g x = f x x"
19081
085b5badb8de * Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents: 19034
diff changeset
   334
19363
667b5ea637dd refined 'abbreviation';
wenzelm
parents: 19279
diff changeset
   335
  abbreviation
21595
wenzelm
parents: 21545
diff changeset
   336
    neq  (infix "=!=" 50) where
19363
667b5ea637dd refined 'abbreviation';
wenzelm
parents: 19279
diff changeset
   337
    "x =!= y == ~ (x === y)"
19081
085b5badb8de * Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents: 19034
diff changeset
   338
19083
wenzelm
parents: 19081
diff changeset
   339
These specifications may be also used in a locale context.  Then the
wenzelm
parents: 19081
diff changeset
   340
constants being introduced depend on certain fixed parameters, and the
wenzelm
parents: 19081
diff changeset
   341
constant name is qualified by the locale base name.  An internal
wenzelm
parents: 19081
diff changeset
   342
abbreviation takes care for convenient input and output, making the
19088
wenzelm
parents: 19084
diff changeset
   343
parameters implicit and using the original short name.  See also
19083
wenzelm
parents: 19081
diff changeset
   344
HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
wenzelm
parents: 19081
diff changeset
   345
entities from a monomorphic theory.
wenzelm
parents: 19081
diff changeset
   346
wenzelm
parents: 19081
diff changeset
   347
Presently, abbreviations are only available 'in' a target locale, but
19363
667b5ea637dd refined 'abbreviation';
wenzelm
parents: 19279
diff changeset
   348
not inherited by general import expressions.  Also note that
667b5ea637dd refined 'abbreviation';
wenzelm
parents: 19279
diff changeset
   349
'abbreviation' may be used as a type-safe replacement for 'syntax' +
667b5ea637dd refined 'abbreviation';
wenzelm
parents: 19279
diff changeset
   350
'translations' in common applications.
19084
wenzelm
parents: 19083
diff changeset
   351
19682
c8c301eb965a * Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents: 19665
diff changeset
   352
Concrete syntax is attached to specified constants in internal form,
c8c301eb965a * Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents: 19665
diff changeset
   353
independently of name spaces.  The parse tree representation is
21209
dbb8decc36bc 'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents: 21200
diff changeset
   354
slightly different -- use 'notation' instead of raw 'syntax', and
19682
c8c301eb965a * Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents: 19665
diff changeset
   355
'translations' with explicit "CONST" markup to accommodate this.
19665
8885951e9c2d * Isar/locale: 'const_syntax';
wenzelm
parents: 19653
diff changeset
   356
21735
0c65e072f4be added print_abbrevs;
wenzelm
parents: 21717
diff changeset
   357
* Pure: command 'print_abbrevs' prints all constant abbreviations of
0c65e072f4be added print_abbrevs;
wenzelm
parents: 21717
diff changeset
   358
the current context.  Print mode "no_abbrevs" prevents inversion of
0c65e072f4be added print_abbrevs;
wenzelm
parents: 21717
diff changeset
   359
abbreviations on output.
0c65e072f4be added print_abbrevs;
wenzelm
parents: 21717
diff changeset
   360
19783
82f365a14960 Improved parameter management of locales.
ballarin
parents: 19715
diff changeset
   361
* Isar/locales: improved parameter handling:
82f365a14960 Improved parameter management of locales.
ballarin
parents: 19715
diff changeset
   362
- use of locales "var" and "struct" no longer necessary;
82f365a14960 Improved parameter management of locales.
ballarin
parents: 19715
diff changeset
   363
- parameter renamings are no longer required to be injective.
82f365a14960 Improved parameter management of locales.
ballarin
parents: 19715
diff changeset
   364
  This enables, for example, to define a locale for endomorphisms thus:
82f365a14960 Improved parameter management of locales.
ballarin
parents: 19715
diff changeset
   365
  locale endom = homom mult mult h.
82f365a14960 Improved parameter management of locales.
ballarin
parents: 19715
diff changeset
   366
19931
fb32b43e7f80 Restructured locales with predicates: import is now an interpretation.
ballarin
parents: 19895
diff changeset
   367
* Isar/locales: changed the way locales with predicates are defined.
fb32b43e7f80 Restructured locales with predicates: import is now an interpretation.
ballarin
parents: 19895
diff changeset
   368
Instead of accumulating the specification, the imported expression is
22126
wenzelm
parents: 22125
diff changeset
   369
now an interpretation.  INCOMPATIBILITY: different normal form of
wenzelm
parents: 22125
diff changeset
   370
locale expressions.  In particular, in interpretations of locales with
wenzelm
parents: 22125
diff changeset
   371
predicates, goals repesenting already interpreted fragments are not
wenzelm
parents: 22125
diff changeset
   372
removed automatically.  Use methods `intro_locales' and
wenzelm
parents: 22125
diff changeset
   373
`unfold_locales'; see below.
wenzelm
parents: 22125
diff changeset
   374
wenzelm
parents: 22125
diff changeset
   375
* Isar/locales: new methods `intro_locales' and `unfold_locales'
wenzelm
parents: 22125
diff changeset
   376
provide backward reasoning on locales predicates.  The methods are
wenzelm
parents: 22125
diff changeset
   377
aware of interpretations and discharge corresponding goals.
wenzelm
parents: 22125
diff changeset
   378
`intro_locales' is less aggressive then `unfold_locales' and does not
wenzelm
parents: 22125
diff changeset
   379
unfold predicates to assumptions.
19931
fb32b43e7f80 Restructured locales with predicates: import is now an interpretation.
ballarin
parents: 19895
diff changeset
   380
fb32b43e7f80 Restructured locales with predicates: import is now an interpretation.
ballarin
parents: 19895
diff changeset
   381
* Isar/locales: the order in which locale fragments are accumulated
22126
wenzelm
parents: 22125
diff changeset
   382
has changed.  This enables to override declarations from fragments due
wenzelm
parents: 22125
diff changeset
   383
to interpretations -- for example, unwanted simp rules.
19931
fb32b43e7f80 Restructured locales with predicates: import is now an interpretation.
ballarin
parents: 19895
diff changeset
   384
23920
4288dc7dc248 interpretation: unfolding of equations;
ballarin
parents: 23889
diff changeset
   385
* Isar/locales: interpretation in theories and proof contexts has been
4288dc7dc248 interpretation: unfolding of equations;
ballarin
parents: 23889
diff changeset
   386
extended.  One may now specify (and prove) equations, which are
4288dc7dc248 interpretation: unfolding of equations;
ballarin
parents: 23889
diff changeset
   387
unfolded in interpreted theorems.  This is useful for replacing
4288dc7dc248 interpretation: unfolding of equations;
ballarin
parents: 23889
diff changeset
   388
defined concepts (constants depending on locale parameters) by
4288dc7dc248 interpretation: unfolding of equations;
ballarin
parents: 23889
diff changeset
   389
concepts already existing in the target context.  Example:
4288dc7dc248 interpretation: unfolding of equations;
ballarin
parents: 23889
diff changeset
   390
4288dc7dc248 interpretation: unfolding of equations;
ballarin
parents: 23889
diff changeset
   391
  interpretation partial_order ["op <= :: [int, int] => bool"]
4288dc7dc248 interpretation: unfolding of equations;
ballarin
parents: 23889
diff changeset
   392
    where "partial_order.less (op <=) (x::int) y = (x < y)"
4288dc7dc248 interpretation: unfolding of equations;
ballarin
parents: 23889
diff changeset
   393
23977
ballarin
parents: 23971
diff changeset
   394
Typically, the constant `partial_order.less' is created by a definition
ballarin
parents: 23971
diff changeset
   395
specification element in the context of locale partial_order.
23920
4288dc7dc248 interpretation: unfolding of equations;
ballarin
parents: 23889
diff changeset
   396
18233
wenzelm
parents: 18145
diff changeset
   397
* Provers/induct: improved internal context management to support
wenzelm
parents: 18145
diff changeset
   398
local fixes and defines on-the-fly.  Thus explicit meta-level
wenzelm
parents: 18145
diff changeset
   399
connectives !! and ==> are rarely required anymore in inductive goals
wenzelm
parents: 18145
diff changeset
   400
(using object-logic connectives for this purpose has been long
wenzelm
parents: 18145
diff changeset
   401
obsolete anyway).  The subsequent proof patterns illustrate advanced
wenzelm
parents: 18145
diff changeset
   402
techniques of natural induction; general datatypes and inductive sets
18267
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   403
work analogously (see also src/HOL/Lambda for realistic examples).
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   404
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   405
(1) This is how to ``strengthen'' an inductive goal wrt. certain
18239
wenzelm
parents: 18238
diff changeset
   406
parameters:
18233
wenzelm
parents: 18145
diff changeset
   407
wenzelm
parents: 18145
diff changeset
   408
  lemma
wenzelm
parents: 18145
diff changeset
   409
    fixes n :: nat and x :: 'a
wenzelm
parents: 18145
diff changeset
   410
    assumes a: "A n x"
wenzelm
parents: 18145
diff changeset
   411
    shows "P n x"
wenzelm
parents: 18145
diff changeset
   412
    using a                     -- {* make induct insert fact a *}
20503
503ac4c5ef91 induct method: renamed 'fixing' to 'arbitrary';
wenzelm
parents: 20500
diff changeset
   413
  proof (induct n arbitrary: x) -- {* generalize goal to "!!x. A n x ==> P n x" *}
18248
wenzelm
parents: 18239
diff changeset
   414
    case 0
18233
wenzelm
parents: 18145
diff changeset
   415
    show ?case sorry
wenzelm
parents: 18145
diff changeset
   416
  next
18248
wenzelm
parents: 18239
diff changeset
   417
    case (Suc n)
18239
wenzelm
parents: 18238
diff changeset
   418
    note `!!x. A n x ==> P n x` -- {* induction hypothesis, according to induction rule *}
wenzelm
parents: 18238
diff changeset
   419
    note `A (Suc n) x`          -- {* induction premise, stemming from fact a *}
18233
wenzelm
parents: 18145
diff changeset
   420
    show ?case sorry
wenzelm
parents: 18145
diff changeset
   421
  qed
wenzelm
parents: 18145
diff changeset
   422
18267
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   423
(2) This is how to perform induction over ``expressions of a certain
18233
wenzelm
parents: 18145
diff changeset
   424
form'', using a locally defined inductive parameter n == "a x"
18239
wenzelm
parents: 18238
diff changeset
   425
together with strengthening (the latter is usually required to get
18267
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   426
sufficiently flexible induction hypotheses):
18233
wenzelm
parents: 18145
diff changeset
   427
wenzelm
parents: 18145
diff changeset
   428
  lemma
wenzelm
parents: 18145
diff changeset
   429
    fixes a :: "'a => nat"
wenzelm
parents: 18145
diff changeset
   430
    assumes a: "A (a x)"
wenzelm
parents: 18145
diff changeset
   431
    shows "P (a x)"
wenzelm
parents: 18145
diff changeset
   432
    using a
20503
503ac4c5ef91 induct method: renamed 'fixing' to 'arbitrary';
wenzelm
parents: 20500
diff changeset
   433
  proof (induct n == "a x" arbitrary: x)
18233
wenzelm
parents: 18145
diff changeset
   434
    ...
wenzelm
parents: 18145
diff changeset
   435
18267
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   436
See also HOL/Isar_examples/Puzzle.thy for an application of the this
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   437
particular technique.
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   438
18901
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   439
(3) This is how to perform existential reasoning ('obtains' or
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   440
'obtain') by induction, while avoiding explicit object-logic
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   441
encodings:
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   442
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   443
  lemma
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   444
    fixes n :: nat
701e53c81c25 * Isar: 'obtains' element;
wenzelm
parents: 18862
diff changeset
   445
    obtains x :: 'a where "P n x" and "Q n x"
20503
503ac4c5ef91 induct method: renamed 'fixing' to 'arbitrary';
wenzelm
parents: 20500
diff changeset
   446
  proof (induct n arbitrary: thesis)
18267
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   447
    case 0
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   448
    obtain x where "P 0 x" and "Q 0 x" sorry
18399
651438736fa1 Provers/induct: coinduct;
wenzelm
parents: 18370
diff changeset
   449
    then show thesis by (rule 0)
18267
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   450
  next
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   451
    case (Suc n)
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   452
    obtain x where "P n x" and "Q n x" by (rule Suc.hyps)
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   453
    obtain x where "P (Suc n) x" and "Q (Suc n) x" sorry
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   454
    then show thesis by (rule Suc.prems)
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   455
  qed
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   456
20503
503ac4c5ef91 induct method: renamed 'fixing' to 'arbitrary';
wenzelm
parents: 20500
diff changeset
   457
Here the 'arbitrary: thesis' specification essentially modifies the
503ac4c5ef91 induct method: renamed 'fixing' to 'arbitrary';
wenzelm
parents: 20500
diff changeset
   458
scope of the formal thesis parameter, in order to the get the whole
18267
5ee688e36eeb * Provers/induct: obtain pattern;
wenzelm
parents: 18248
diff changeset
   459
existence statement through the induction as expected.
18233
wenzelm
parents: 18145
diff changeset
   460
18506
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   461
* Provers/induct: mutual induction rules are now specified as a list
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   462
of rule sharing the same induction cases.  HOL packages usually
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   463
provide foo_bar.inducts for mutually defined items foo and bar
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   464
(e.g. inductive sets or datatypes).  INCOMPATIBILITY, users need to
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   465
specify mutual induction rules differently, i.e. like this:
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   466
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   467
  (induct rule: foo_bar.inducts)
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   468
  (induct set: foo bar)
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   469
  (induct type: foo bar)
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   470
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   471
The ML function ProjectRule.projections turns old-style rules into the
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   472
new format.
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   473
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   474
* Provers/induct: improved handling of simultaneous goals.  Instead of
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   475
introducing object-level conjunction, the statement is now split into
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   476
several conclusions, while the corresponding symbolic cases are
18601
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   477
nested accordingly.  INCOMPATIBILITY, proofs need to be structured
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   478
explicitly.  For example:
18480
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   479
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   480
  lemma
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   481
    fixes n :: nat
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   482
    shows "P n" and "Q n"
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   483
  proof (induct n)
18601
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   484
    case 0 case 1
18480
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   485
    show "P 0" sorry
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   486
  next
18601
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   487
    case 0 case 2
18480
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   488
    show "Q 0" sorry
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   489
  next
18601
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   490
    case (Suc n) case 1
18480
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   491
    note `P n` and `Q n`
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   492
    show "P (Suc n)" sorry
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   493
  next
18601
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   494
    case (Suc n) case 2
18480
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   495
    note `P n` and `Q n`
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   496
    show "Q (Suc n)" sorry
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   497
  qed
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   498
18601
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   499
The split into subcases may be deferred as follows -- this is
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   500
particularly relevant for goal statements with local premises.
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   501
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   502
  lemma
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   503
    fixes n :: nat
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   504
    shows "A n ==> P n" and "B n ==> Q n"
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   505
  proof (induct n)
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   506
    case 0
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   507
    {
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   508
      case 1
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   509
      note `A 0`
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   510
      show "P 0" sorry
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   511
    next
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   512
      case 2
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   513
      note `B 0`
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   514
      show "Q 0" sorry
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   515
    }
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   516
  next
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   517
    case (Suc n)
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   518
    note `A n ==> P n` and `B n ==> Q n`
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   519
    {
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   520
      case 1
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   521
      note `A (Suc n)`
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   522
      show "P (Suc n)" sorry
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   523
    next
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   524
      case 2
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   525
      note `B (Suc n)`
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   526
      show "Q (Suc n)" sorry
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   527
    }
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   528
  qed
b248754b60bc * Provers/induct: improved simultaneous goals -- nested cases;
wenzelm
parents: 18590
diff changeset
   529
18506
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   530
If simultaneous goals are to be used with mutual rules, the statement
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   531
needs to be structured carefully as a two-level conjunction, using
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   532
lists of propositions separated by 'and':
96260fb11449 * Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents: 18495
diff changeset
   533
18507
wenzelm
parents: 18506
diff changeset
   534
  lemma
wenzelm
parents: 18506
diff changeset
   535
    shows "a : A ==> P1 a"
wenzelm
parents: 18506
diff changeset
   536
          "a : A ==> P2 a"
wenzelm
parents: 18506
diff changeset
   537
      and "b : B ==> Q1 b"
wenzelm
parents: 18506
diff changeset
   538
          "b : B ==> Q2 b"
wenzelm
parents: 18506
diff changeset
   539
          "b : B ==> Q3 b"
wenzelm
parents: 18506
diff changeset
   540
  proof (induct set: A B)
18480
8ac97f71369d * induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents: 18450
diff changeset
   541
18399
651438736fa1 Provers/induct: coinduct;
wenzelm
parents: 18370
diff changeset
   542
* Provers/induct: support coinduction as well.  See
651438736fa1 Provers/induct: coinduct;
wenzelm
parents: 18370
diff changeset
   543
src/HOL/Library/Coinductive_List.thy for various examples.
651438736fa1 Provers/induct: coinduct;
wenzelm
parents: 18370
diff changeset
   544
20919
dab803075c62 attribute "symmetric": standardized schematic variables;
wenzelm
parents: 20857
diff changeset
   545
* Attribute "symmetric" produces result with standardized schematic
dab803075c62 attribute "symmetric": standardized schematic variables;
wenzelm
parents: 20857
diff changeset
   546
variables (index 0).  Potential INCOMPATIBILITY.
dab803075c62 attribute "symmetric": standardized schematic variables;
wenzelm
parents: 20857
diff changeset
   547
22126
wenzelm
parents: 22125
diff changeset
   548
* Simplifier: by default the simplifier trace only shows top level
wenzelm
parents: 22125
diff changeset
   549
rewrites now. That is, trace_simp_depth_limit is set to 1 by
wenzelm
parents: 22125
diff changeset
   550
default. Thus there is less danger of being flooded by the trace. The
wenzelm
parents: 22125
diff changeset
   551
trace indicates where parts have been suppressed.
18674
98d380757893 *** empty log message ***
nipkow
parents: 18644
diff changeset
   552
  
18536
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   553
* Provers/classical: removed obsolete classical version of elim_format
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   554
attribute; classical elim/dest rules are now treated uniformly when
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   555
manipulating the claset.
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   556
18694
83f50ac6ddcb * Classical: optional weight for attributes;
wenzelm
parents: 18687
diff changeset
   557
* Provers/classical: stricter checks to ensure that supplied intro,
83f50ac6ddcb * Classical: optional weight for attributes;
wenzelm
parents: 18687
diff changeset
   558
dest and elim rules are well-formed; dest and elim rules must have at
83f50ac6ddcb * Classical: optional weight for attributes;
wenzelm
parents: 18687
diff changeset
   559
least one premise.
83f50ac6ddcb * Classical: optional weight for attributes;
wenzelm
parents: 18687
diff changeset
   560
83f50ac6ddcb * Classical: optional weight for attributes;
wenzelm
parents: 18687
diff changeset
   561
* Provers/classical: attributes dest/elim/intro take an optional
18695
wenzelm
parents: 18694
diff changeset
   562
weight argument for the rule (just as the Pure versions).  Weights are
18696
wenzelm
parents: 18695
diff changeset
   563
ignored by automated tools, but determine the search order of single
18694
83f50ac6ddcb * Classical: optional weight for attributes;
wenzelm
parents: 18687
diff changeset
   564
rule steps.
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18549
diff changeset
   565
18536
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   566
* Syntax: input syntax now supports dummy variable binding "%_. b",
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   567
where the body does not mention the bound variable.  Note that dummy
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   568
patterns implicitly depend on their context of bounds, which makes
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   569
"{_. _}" match any set comprehension as expected.  Potential
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   570
INCOMPATIBILITY -- parse translations need to cope with syntactic
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   571
constant "_idtdummy" in the binding position.
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   572
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   573
* Syntax: removed obsolete syntactic constant "_K" and its associated
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   574
parse translation.  INCOMPATIBILITY -- use dummy abstraction instead,
ab3f32f86847 * Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents: 18507
diff changeset
   575
for example "A -> B" => "Pi A (%_. B)".
17779
407bea05c2da added dummy variable binding;
wenzelm
parents: 17754
diff changeset
   576
20582
ebd0e03c6a9b * Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents: 20503
diff changeset
   577
* Pure: 'class_deps' command visualizes the subclass relation, using
ebd0e03c6a9b * Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents: 20503
diff changeset
   578
the graph browser tool.
ebd0e03c6a9b * Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents: 20503
diff changeset
   579
20620
8b26f58c5646 * Pure: 'print_theory' now suppresses entities with internal name;
wenzelm
parents: 20607
diff changeset
   580
* Pure: 'print_theory' now suppresses entities with internal name
8b26f58c5646 * Pure: 'print_theory' now suppresses entities with internal name;
wenzelm
parents: 20607
diff changeset
   581
(trailing "_") by default; use '!' option for full details.
8b26f58c5646 * Pure: 'print_theory' now suppresses entities with internal name;
wenzelm
parents: 20607
diff changeset
   582
17865
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
   583
17806
b6a547bfb419 *** empty log message ***
nipkow
parents: 17780
diff changeset
   584
*** HOL ***
b6a547bfb419 *** empty log message ***
nipkow
parents: 17780
diff changeset
   585
23850
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   586
* Code generator library theories:
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   587
  * Pretty_Int represents HOL integers by big integer literals in target
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   588
    languages.
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   589
  * Pretty_Char represents HOL characters by character literals in target
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   590
    languages.
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   591
  * Pretty_Char_chr like Pretty_Char, but also offers treatment of character
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   592
    codes; includes Pretty_Int.
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   593
  * Executable_Set allows to generate code for finite sets using lists.
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   594
  * Executable_Rat implements rational numbers as triples (sign, enumerator,
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   595
    denominator).
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   596
  * Executable_Real implements a subset of real numbers, namly those
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   597
    representable by rational numbers.
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   598
  * Efficient_Nat implements natural numbers by integers, which in general will
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   599
    result in higher efficency; pattern matching with 0/Suc is eliminated;
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   600
    includes Pretty_Int.
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   601
  * ML_String provides an additional datatype ml_string; in the HOL default
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   602
    setup, strings in HOL are mapped to lists of HOL characters in SML; values
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   603
    of type ml_string are mapped to strings in SML.
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   604
  * ML_Int provides an additional datatype ml_int which is mapped to to SML
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   605
    built-in integers.
f1434532a562 updated
haftmann
parents: 23783
diff changeset
   606
23783
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   607
* New package for inductive predicates
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   608
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   609
  An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   610
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   611
    inductive
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   612
      p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   613
      for z_1 :: U_1 and ... and z_n :: U_m
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   614
    where
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   615
      rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   616
    | ...
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   617
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   618
  rather than
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   619
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   620
    consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   621
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   622
    abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   623
    where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   624
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   625
    inductive "s z_1 ... z_m"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   626
    intros
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   627
      rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   628
      ...
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   629
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   630
  For backward compatibility, there is a wrapper allowing inductive
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   631
  sets to be defined with the new package via
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   632
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   633
    inductive_set
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   634
      s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   635
      for z_1 :: U_1 and ... and z_n :: U_m
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   636
    where
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   637
      rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   638
    | ...
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   639
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   640
  or
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   641
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   642
    inductive_set
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   643
      s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   644
      and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   645
      for z_1 :: U_1 and ... and z_n :: U_m
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   646
    where
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   647
      "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   648
    | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   649
    | ...
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   650
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   651
  if the additional syntax "p ..." is required.
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   652
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   653
  Many examples can be found in the subdirectories Auth, Bali, Induct,
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   654
  or MicroJava.
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   655
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   656
  INCOMPATIBILITIES:
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   657
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   658
  - Since declaration and definition of inductive sets or predicates
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   659
    is no longer separated, abbreviations involving the newly introduced
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   660
    sets or predicates must be specified together with the introduction
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   661
    rules after the "where" keyword (see example above), rather than before
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   662
    the actual inductive definition.
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   663
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   664
  - The variables in induction and elimination rules are now quantified
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   665
    in the order of their occurrence in the introduction rules, rather than
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   666
    in alphabetical order. Since this may break some proofs, these proofs
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   667
    either have to be repaired, e.g. by reordering the variables
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   668
    a_i_1 ... a_i_{k_i} in Isar "case" statements of the form
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   669
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   670
      case (rule_i a_i_1 ... a_i_{k_i})
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   671
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   672
    or the old order of quantification has to be restored by explicitly adding
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   673
    meta-level quantifiers in the introduction rules, i.e.
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   674
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   675
      | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   676
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   677
  - The format of the elimination rules is now
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   678
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   679
      p z_1 ... z_m x_1 ... x_n ==>
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   680
        (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   681
        ==> ... ==> P
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   682
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   683
    for predicates and
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   684
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   685
      (x_1, ..., x_n) : s z_1 ... z_m ==>
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   686
        (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   687
        ==> ... ==> P
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   688
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   689
    for sets rather than
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   690
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   691
      x : s z_1 ... z_m ==>
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   692
        (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   693
        ==> ... ==> P
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   694
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   695
    This may require terms in goals to be expanded to n-tuples (e.g. using case_tac
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   696
    or simplification with the split_paired_all rule) before the above elimination
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   697
    rule is applicable.
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   698
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   699
  - The elimination or case analysis rules for (mutually) inductive sets or
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   700
    predicates are now called "p_1.cases" ... "p_k.cases". The list of rules
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   701
    "p_1_..._p_k.elims" is no longer available.
e4d514f81d95 Added entry for new inductive definition package.
berghofe
parents: 23565
diff changeset
   702
23562
wenzelm
parents: 23509
diff changeset
   703
* Method "metis" proves goals by applying the Metis general-purpose
wenzelm
parents: 23509
diff changeset
   704
resolution prover.  Examples are in the directory MetisExamples.  See
wenzelm
parents: 23509
diff changeset
   705
also http://gilith.com/software/metis/
23449
dd874e6a3282 integration of Metis prover
paulson
parents: 23379
diff changeset
   706
  
23562
wenzelm
parents: 23509
diff changeset
   707
* Command 'sledgehammer' invokes external automatic theorem provers as
wenzelm
parents: 23509
diff changeset
   708
background processes.  It generates calls to the "metis" method if
wenzelm
parents: 23509
diff changeset
   709
successful. These can be pasted into the proof.  Users do not have to
wenzelm
parents: 23509
diff changeset
   710
wait for the automatic provers to return.
23449
dd874e6a3282 integration of Metis prover
paulson
parents: 23379
diff changeset
   711
23564
ae0e735fbec8 *** empty log message ***
nipkow
parents: 23562
diff changeset
   712
* Case-expressions allow arbitrary constructor-patterns (including "_") and
23565
c00b12a4e245 *** empty log message ***
nipkow
parents: 23564
diff changeset
   713
  take their order into account, like in functional programming.
23564
ae0e735fbec8 *** empty log message ***
nipkow
parents: 23562
diff changeset
   714
  Internally, this is translated into nested case-expressions; missing cases
ae0e735fbec8 *** empty log message ***
nipkow
parents: 23562
diff changeset
   715
  are added and mapped to the predefined constant "undefined". In complicated
ae0e735fbec8 *** empty log message ***
nipkow
parents: 23562
diff changeset
   716
  cases printing may no longer show the original input but the internal
23565
c00b12a4e245 *** empty log message ***
nipkow
parents: 23564
diff changeset
   717
  form. Lambda-abstractions allow the same form of pattern matching:
23564
ae0e735fbec8 *** empty log message ***
nipkow
parents: 23562
diff changeset
   718
  "% pat1 => e1 | ..." is an abbreviation for
ae0e735fbec8 *** empty log message ***
nipkow
parents: 23562
diff changeset
   719
  "%x. case x of pat1 => e1 | ..." where x is a new variable.
ae0e735fbec8 *** empty log message ***
nipkow
parents: 23562
diff changeset
   720
23468
d27d79a47592 changed simp rules for of_nat
huffman
parents: 23449
diff changeset
   721
* IntDef: The constant "int :: nat => int" has been removed; now "int"
d27d79a47592 changed simp rules for of_nat
huffman
parents: 23449
diff changeset
   722
  is an abbreviation for "of_nat :: nat => int". The simplification rules
d27d79a47592 changed simp rules for of_nat
huffman
parents: 23449
diff changeset
   723
  for "of_nat" have been changed to work like "int" did previously.
d27d79a47592 changed simp rules for of_nat
huffman
parents: 23449
diff changeset
   724
  (potential INCOMPATIBILITY)
d27d79a47592 changed simp rules for of_nat
huffman
parents: 23449
diff changeset
   725
  - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
d27d79a47592 changed simp rules for of_nat
huffman
parents: 23449
diff changeset
   726
  - of_nat_diff and of_nat_mult are no longer default simp rules
23377
197b6a39592c int abbreviates of_nat
huffman
parents: 23369
diff changeset
   727
23295
86e225406859 Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents: 23251
diff changeset
   728
* Method "algebra" solves polynomial equations over (semi)rings using
86e225406859 Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents: 23251
diff changeset
   729
  Groebner bases. The (semi)ring structure is defined by locales and
86e225406859 Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents: 23251
diff changeset
   730
  the tool setup depends on that generic context. Installing the
86e225406859 Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents: 23251
diff changeset
   731
  method for a specific type involves instantiating the locale and
86e225406859 Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents: 23251
diff changeset
   732
  possibly adding declarations for computation on the coefficients.
86e225406859 Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents: 23251
diff changeset
   733
  The method is already instantiated for natural numbers and for the
86e225406859 Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents: 23251
diff changeset
   734
  axiomatic class of idoms with numerals.  See also the paper by
86e225406859 Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents: 23251
diff changeset
   735
  Chaieb and Wenzel at CALCULEMUS 2007 for the general principles
86e225406859 Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents: 23251
diff changeset
   736
  underlying this architecture of context-aware proof-tools.
86e225406859 Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents: 23251
diff changeset
   737
23029
79ee75dc1e59 constant op @ now named append
haftmann
parents: 23013
diff changeset
   738
* constant "List.op @" now named "List.append".  Use ML antiquotations
79ee75dc1e59 constant op @ now named append
haftmann
parents: 23013
diff changeset
   739
@{const_name List.append} or @{term " ... @ ... "} to circumvent
79ee75dc1e59 constant op @ now named append
haftmann
parents: 23013
diff changeset
   740
possible incompatibilities when working on ML level.
79ee75dc1e59 constant op @ now named append
haftmann
parents: 23013
diff changeset
   741
22997
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   742
* Constant renames due to introduction of canonical name prefixing for
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   743
  class package:
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   744
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   745
    HOL.abs ~> HOL.minus_class.abs
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   746
    HOL.divide ~> HOL.divide_class.divide
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   747
    Nat.power ~> Nat.power_class.power
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   748
    Nat.size ~> Nat.size_class.size
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   749
    Numeral.number_of ~> Numeral.number_class.number_of
23129
haftmann
parents: 23116
diff changeset
   750
    FixedPoint.Inf ~> FixedPoint.complete_lattice_class.Inf
haftmann
parents: 23116
diff changeset
   751
23180
80b9caed2ba8 fixed typo
haftmann
parents: 23129
diff changeset
   752
* Rudimentary class target mechanism involves constant renames:
23129
haftmann
parents: 23116
diff changeset
   753
haftmann
parents: 23116
diff changeset
   754
    Orderings.min ~> Orderings.ord_class.min
haftmann
parents: 23116
diff changeset
   755
    Orderings.max ~> Orderings.ord_class.max
haftmann
parents: 23116
diff changeset
   756
    FixedPoint.Sup ~> FixedPoint.complete_lattice_class.Sup
22997
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   757
23564
ae0e735fbec8 *** empty log message ***
nipkow
parents: 23562
diff changeset
   758
* primrec: missing cases mapped to "undefined" instead of "arbitrary"
22845
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22826
diff changeset
   759
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22826
diff changeset
   760
* new constant "undefined" with axiom "undefined x = undefined"
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22826
diff changeset
   761
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22826
diff changeset
   762
* new class "default" with associated constant "default"
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22826
diff changeset
   763
23104
0a47a5681704 *** empty log message ***
nipkow
parents: 23103
diff changeset
   764
* new function listsum :: 'a list => 'a for arbitrary monoids.
0a47a5681704 *** empty log message ***
nipkow
parents: 23103
diff changeset
   765
  Special syntax: "SUM x <- xs. f x" (and latex variants)
0a47a5681704 *** empty log message ***
nipkow
parents: 23103
diff changeset
   766
23210
a0cb15114e7a *** empty log message ***
nipkow
parents: 23180
diff changeset
   767
* new (input only) syntax for Haskell-like list comprehension, eg
a0cb15114e7a *** empty log message ***
nipkow
parents: 23180
diff changeset
   768
  [(x,y). x <- xs, y <- ys, x ~= y]
a0cb15114e7a *** empty log message ***
nipkow
parents: 23180
diff changeset
   769
  For details see List.thy.
23102
559709b43104 *** empty log message ***
nipkow
parents: 23029
diff changeset
   770
23300
b785068bd5dc *** empty log message ***
nipkow
parents: 23295
diff changeset
   771
* The special syntax for function "filter" has changed from [x : xs. P] to
b785068bd5dc *** empty log message ***
nipkow
parents: 23295
diff changeset
   772
  [x <- xs. P] to avoid an ambiguity caused by list comprehension syntax,
b785068bd5dc *** empty log message ***
nipkow
parents: 23295
diff changeset
   773
  and for uniformity. INCOMPATIBILITY
b785068bd5dc *** empty log message ***
nipkow
parents: 23295
diff changeset
   774
23971
e6d505d5b03d renamed lemma "set_take_whileD" to "set_takeWhileD"
krauss
parents: 23920
diff changeset
   775
* Lemma "set_take_whileD" renamed to "set_takeWhileD"
e6d505d5b03d renamed lemma "set_take_whileD" to "set_takeWhileD"
krauss
parents: 23920
diff changeset
   776
23480
8d01ccdc3652 *** empty log message ***
nipkow
parents: 23478
diff changeset
   777
* New lemma collection field_simps (an extension of ring_simps)
8d01ccdc3652 *** empty log message ***
nipkow
parents: 23478
diff changeset
   778
  for manipulating (in)equations involving division. Multiplies
23481
93dca7620d0d *** empty log message ***
nipkow
parents: 23480
diff changeset
   779
  with all denominators that can be proved to be non-zero (in equations)
23480
8d01ccdc3652 *** empty log message ***
nipkow
parents: 23478
diff changeset
   780
  or positive/negative (in inequations).
8d01ccdc3652 *** empty log message ***
nipkow
parents: 23478
diff changeset
   781
8d01ccdc3652 *** empty log message ***
nipkow
parents: 23478
diff changeset
   782
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
23478
26a5ef187e8b *** empty log message ***
nipkow
parents: 23468
diff changeset
   783
  have been improved and renamed to ring_simps, group_simps and ring_distribs.
23509
14a2f87ccc73 *** empty log message ***
nipkow
parents: 23495
diff changeset
   784
  Removed lemmas field_xyz in Ring_and_Field
14a2f87ccc73 *** empty log message ***
nipkow
parents: 23495
diff changeset
   785
  because they were subsumed by lemmas xyz.
14a2f87ccc73 *** empty log message ***
nipkow
parents: 23495
diff changeset
   786
INCOMPATIBILITY.
23478
26a5ef187e8b *** empty log message ***
nipkow
parents: 23468
diff changeset
   787
22799
ed7d53db2170 moved code generation pretty integers and characters to separate theories
haftmann
parents: 22754
diff changeset
   788
* Library/Pretty_Int.thy: maps HOL numerals on target language integer literals
23480
8d01ccdc3652 *** empty log message ***
nipkow
parents: 23478
diff changeset
   789
  when generating code.
22799
ed7d53db2170 moved code generation pretty integers and characters to separate theories
haftmann
parents: 22754
diff changeset
   790
ed7d53db2170 moved code generation pretty integers and characters to separate theories
haftmann
parents: 22754
diff changeset
   791
* Library/Pretty_Char.thy: maps HOL characters on target language character literals
23480
8d01ccdc3652 *** empty log message ***
nipkow
parents: 23478
diff changeset
   792
  when generating code.
22799
ed7d53db2170 moved code generation pretty integers and characters to separate theories
haftmann
parents: 22754
diff changeset
   793
22735
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
   794
* Library/Commutative_Ring.thy: switched from recdef to function package;
23480
8d01ccdc3652 *** empty log message ***
nipkow
parents: 23478
diff changeset
   795
  constants add, mul, pow now curried.  Infix syntax for algebraic operations.
22735
cf627add250a code generator changes
haftmann
parents: 22450
diff changeset
   796
22450
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   797
* Some steps towards more uniform lattice theory development in HOL.
22422
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   798
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   799
    constants "meet" and "join" now named "inf" and "sup"
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   800
    constant "Meet" now named "Inf"
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   801
22450
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   802
    classes "meet_semilorder" and "join_semilorder" now named
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   803
      "lower_semilattice" and "upper_semilattice"
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   804
    class "lorder" now named "lattice"
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   805
    class "comp_lat" now named "complete_lattice"
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   806
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   807
    Instantiation of lattice classes allows explicit definitions
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   808
    for "inf" and "sup" operations.
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   809
23129
haftmann
parents: 23116
diff changeset
   810
  INCOMPATIBILITY.  Theorem renames:
22450
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   811
22422
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   812
    meet_left_le            ~> inf_le1
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   813
    meet_right_le           ~> inf_le2
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   814
    join_left_le            ~> sup_ge1
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   815
    join_right_le           ~> sup_ge2
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   816
    meet_join_le            ~> inf_sup_ord
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   817
    le_meetI                ~> le_infI
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   818
    join_leI                ~> le_supI
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   819
    le_meet                 ~> le_inf_iff
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   820
    le_join                 ~> ge_sup_conv
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   821
    meet_idempotent         ~> inf_idem
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   822
    join_idempotent         ~> sup_idem
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   823
    meet_comm               ~> inf_commute
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   824
    join_comm               ~> sup_commute
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   825
    meet_leI1               ~> le_infI1
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   826
    meet_leI2               ~> le_infI2
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   827
    le_joinI1               ~> le_supI1
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   828
    le_joinI2               ~> le_supI2
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   829
    meet_assoc              ~> inf_assoc
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   830
    join_assoc              ~> sup_assoc
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   831
    meet_left_comm          ~> inf_left_commute
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   832
    meet_left_idempotent    ~> inf_left_idem
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   833
    join_left_comm          ~> sup_left_commute
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   834
    join_left_idempotent    ~> sup_left_idem
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   835
    meet_aci                ~> inf_aci
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   836
    join_aci                ~> sup_aci
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   837
    le_def_meet             ~> le_iff_inf
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   838
    le_def_join             ~> le_iff_sup
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   839
    join_absorp2            ~> sup_absorb2
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   840
    join_absorp1            ~> sup_absorb1
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   841
    meet_absorp1            ~> inf_absorb1
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   842
    meet_absorp2            ~> inf_absorb2
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   843
    meet_join_absorp        ~> inf_sup_absorb
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   844
    join_meet_absorp        ~> sup_inf_absorb
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   845
    distrib_join_le         ~> distrib_sup_le
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   846
    distrib_meet_le         ~> distrib_inf_le
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   847
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   848
    add_meet_distrib_left   ~> add_inf_distrib_left
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   849
    add_join_distrib_left   ~> add_sup_distrib_left
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   850
    is_join_neg_meet        ~> is_join_neg_inf
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   851
    is_meet_neg_join        ~> is_meet_neg_sup
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   852
    add_meet_distrib_right  ~> add_inf_distrib_right
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   853
    add_join_distrib_right  ~> add_sup_distrib_right
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   854
    add_meet_join_distribs  ~> add_sup_inf_distribs
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   855
    join_eq_neg_meet        ~> sup_eq_neg_inf
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   856
    meet_eq_neg_join        ~> inf_eq_neg_sup
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   857
    add_eq_meet_join        ~> add_eq_inf_sup
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   858
    meet_0_imp_0            ~> inf_0_imp_0
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   859
    join_0_imp_0            ~> sup_0_imp_0
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   860
    meet_0_eq_0             ~> inf_0_eq_0
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   861
    join_0_eq_0             ~> sup_0_eq_0
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   862
    neg_meet_eq_join        ~> neg_inf_eq_sup
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   863
    neg_join_eq_meet        ~> neg_sup_eq_inf
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   864
    join_eq_if              ~> sup_eq_if
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   865
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   866
    mono_meet               ~> mono_inf
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   867
    mono_join               ~> mono_sup
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   868
    meet_bool_eq            ~> inf_bool_eq
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   869
    join_bool_eq            ~> sup_bool_eq
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   870
    meet_fun_eq             ~> inf_fun_eq
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   871
    join_fun_eq             ~> sup_fun_eq
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   872
    meet_set_eq             ~> inf_set_eq
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   873
    join_set_eq             ~> sup_set_eq
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   874
    meet1_iff               ~> inf1_iff
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   875
    meet2_iff               ~> inf2_iff
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   876
    meet1I                  ~> inf1I
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   877
    meet2I                  ~> inf2I
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   878
    meet1D1                 ~> inf1D1
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   879
    meet2D1                 ~> inf2D1
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   880
    meet1D2                 ~> inf1D2
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   881
    meet2D2                 ~> inf2D2
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   882
    meet1E                  ~> inf1E
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   883
    meet2E                  ~> inf2E
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   884
    join1_iff               ~> sup1_iff
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   885
    join2_iff               ~> sup2_iff
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   886
    join1I1                 ~> sup1I1
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   887
    join2I1                 ~> sup2I1
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   888
    join1I1                 ~> sup1I1
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   889
    join2I2                 ~> sup1I2
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   890
    join1CI                 ~> sup1CI
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   891
    join2CI                 ~> sup2CI
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   892
    join1E                  ~> sup1E
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   893
    join2E                  ~> sup2E
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   894
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   895
    is_meet_Meet            ~> is_meet_Inf
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   896
    Meet_bool_def           ~> Inf_bool_def
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   897
    Meet_fun_def            ~> Inf_fun_def
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   898
    Meet_greatest           ~> Inf_greatest
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   899
    Meet_lower              ~> Inf_lower
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   900
    Meet_set_def            ~> Inf_set_def
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   901
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   902
    listsp_meetI            ~> listsp_infI
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   903
    listsp_meet_eq          ~> listsp_inf_eq
ee19cdb07528 stepping towards uniform lattice theory development in HOL
haftmann
parents: 22384
diff changeset
   904
22450
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   905
    meet_min                ~> inf_min
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   906
    join_max                ~> sup_max
51ee032f9591 lattice cleanup
haftmann
parents: 22422
diff changeset
   907
22845
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22826
diff changeset
   908
* Classes "order" and "linorder": facts "refl", "trans" and
22384
33a46e6c7f04 prefix of class interpretation not mandatory any longer
haftmann
parents: 22376
diff changeset
   909
"cases" renamed ro "order_refl", "order_trans" and "linorder_cases", to
33a46e6c7f04 prefix of class interpretation not mandatory any longer
haftmann
parents: 22376
diff changeset
   910
avoid clashes with HOL "refl" and "trans". INCOMPATIBILITY.
33a46e6c7f04 prefix of class interpretation not mandatory any longer
haftmann
parents: 22376
diff changeset
   911
22845
5f9138bcb3d7 changed code generator invocation syntax
haftmann
parents: 22826
diff changeset
   912
* Classes "order" and "linorder": 
22316
f662831459de added class "preorder"
haftmann
parents: 22218
diff changeset
   913
potential INCOMPATIBILITY: order of proof goals in order/linorder instance
f662831459de added class "preorder"
haftmann
parents: 22218
diff changeset
   914
proofs changed.
f662831459de added class "preorder"
haftmann
parents: 22218
diff changeset
   915
22218
30a8890d2967 dropped lemma duplicates in HOL.thy
haftmann
parents: 22152
diff changeset
   916
* Dropped lemma duplicate def_imp_eq in favor of meta_eq_to_obj_eq.
30a8890d2967 dropped lemma duplicates in HOL.thy
haftmann
parents: 22152
diff changeset
   917
INCOMPATIBILITY.
30a8890d2967 dropped lemma duplicates in HOL.thy
haftmann
parents: 22152
diff changeset
   918
30a8890d2967 dropped lemma duplicates in HOL.thy
haftmann
parents: 22152
diff changeset
   919
* Dropped lemma duplicate if_def2 in favor of if_bool_eq_conj.
30a8890d2967 dropped lemma duplicates in HOL.thy
haftmann
parents: 22152
diff changeset
   920
INCOMPATIBILITY.
30a8890d2967 dropped lemma duplicates in HOL.thy
haftmann
parents: 22152
diff changeset
   921
22126
wenzelm
parents: 22125
diff changeset
   922
* Added syntactic class "size"; overloaded constant "size" now has
wenzelm
parents: 22125
diff changeset
   923
type "'a::size ==> bool"
wenzelm
parents: 22125
diff changeset
   924
wenzelm
parents: 22125
diff changeset
   925
* Renamed constants "Divides.op div", "Divides.op mod" and "Divides.op
22997
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   926
dvd" to "Divides.div_class.div", "Divides.div_class.mod" and "Divides.dvd". INCOMPATIBILITY.
22126
wenzelm
parents: 22125
diff changeset
   927
wenzelm
parents: 22125
diff changeset
   928
* Added method "lexicographic_order" automatically synthesizes
wenzelm
parents: 22125
diff changeset
   929
termination relations as lexicographic combinations of size measures
wenzelm
parents: 22125
diff changeset
   930
-- 'function' package.
wenzelm
parents: 22125
diff changeset
   931
wenzelm
parents: 22125
diff changeset
   932
* HOL/records: generalised field-update to take a function on the
wenzelm
parents: 22125
diff changeset
   933
field rather than the new value: r(|A := x|) is translated to A_update
wenzelm
parents: 22125
diff changeset
   934
(K x) r The K-combinator that is internally used is called K_record.
21226
a607ae87ee81 field-update in records is generalised to take a function on the field
schirmer
parents: 21215
diff changeset
   935
INCOMPATIBILITY: Usage of the plain update functions has to be
a607ae87ee81 field-update in records is generalised to take a function on the field
schirmer
parents: 21215
diff changeset
   936
adapted.
a607ae87ee81 field-update in records is generalised to take a function on the field
schirmer
parents: 21215
diff changeset
   937
 
22126
wenzelm
parents: 22125
diff changeset
   938
* axclass "semiring_0" now contains annihilation axioms x * 0 = 0 and
wenzelm
parents: 22125
diff changeset
   939
0 * x = 0, which are required for a semiring.  Richer structures do
wenzelm
parents: 22125
diff changeset
   940
not inherit from semiring_0 anymore, because this property is a
wenzelm
parents: 22125
diff changeset
   941
theorem there, not an axiom.  INCOMPATIBILITY: In instances of
wenzelm
parents: 22125
diff changeset
   942
semiring_0, there is more to prove, but this is mostly trivial.
wenzelm
parents: 22125
diff changeset
   943
wenzelm
parents: 22125
diff changeset
   944
* axclass "recpower" was generalized to arbitrary monoids, not just
wenzelm
parents: 22125
diff changeset
   945
commutative semirings.  INCOMPATIBILITY: If you use recpower and need
wenzelm
parents: 22125
diff changeset
   946
commutativity or a semiring property, add the corresponding classes.
wenzelm
parents: 22125
diff changeset
   947
wenzelm
parents: 22125
diff changeset
   948
* Unified locale partial_order with class definition (cf. theory
wenzelm
parents: 22125
diff changeset
   949
Orderings), added parameter ``less''.  INCOMPATIBILITY.
21215
7c9337a0e30a made locale partial_order compatible with axclass order
haftmann
parents: 21209
diff changeset
   950
21099
6a0cdb6f72d3 (added entry)
haftmann
parents: 21056
diff changeset
   951
* Constant "List.list_all2" in List.thy now uses authentic syntax.
22126
wenzelm
parents: 22125
diff changeset
   952
INCOMPATIBILITY: translations containing list_all2 may go wrong.  On
wenzelm
parents: 22125
diff changeset
   953
Isar level, use abbreviations instead.
wenzelm
parents: 22125
diff changeset
   954
wenzelm
parents: 22125
diff changeset
   955
* Renamed constant "List.op mem" to "List.memberl" INCOMPATIBILITY:
wenzelm
parents: 22125
diff changeset
   956
rarely occuring name references (e.g. ``List.op mem.simps'') require
wenzelm
parents: 22125
diff changeset
   957
renaming (e.g. ``List.memberl.simps'').
wenzelm
parents: 22125
diff changeset
   958
22997
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   959
* Renamed constants "0" to "HOL.zero_class.zero" and "1" to "HOL.one_class.one".
22126
wenzelm
parents: 22125
diff changeset
   960
INCOMPATIBILITY.
wenzelm
parents: 22125
diff changeset
   961
23251
471b576aad25 moved generic algebra modules
haftmann
parents: 23210
diff changeset
   962
* Added class "HOL.eq", allowing for code generation with polymorphic equality.
22126
wenzelm
parents: 22125
diff changeset
   963
wenzelm
parents: 22125
diff changeset
   964
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has
wenzelm
parents: 22125
diff changeset
   965
been abandoned in favour of plain 'int'. INCOMPATIBILITY --
wenzelm
parents: 22125
diff changeset
   966
significant changes for setting up numeral syntax for types:
20485
3078fd2eec7b got rid of Numeral.bin type
haftmann
parents: 20453
diff changeset
   967
3078fd2eec7b got rid of Numeral.bin type
haftmann
parents: 20453
diff changeset
   968
  - new constants Numeral.pred and Numeral.succ instead
3078fd2eec7b got rid of Numeral.bin type
haftmann
parents: 20453
diff changeset
   969
      of former Numeral.bin_pred and Numeral.bin_succ.
3078fd2eec7b got rid of Numeral.bin type
haftmann
parents: 20453
diff changeset
   970
  - Use integer operations instead of bin_add, bin_mult and so on.
3078fd2eec7b got rid of Numeral.bin type
haftmann
parents: 20453
diff changeset
   971
  - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3078fd2eec7b got rid of Numeral.bin type
haftmann
parents: 20453
diff changeset
   972
  - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3078fd2eec7b got rid of Numeral.bin type
haftmann
parents: 20453
diff changeset
   973
3078fd2eec7b got rid of Numeral.bin type
haftmann
parents: 20453
diff changeset
   974
See HOL/Integ/IntArith.thy for an example setup.
3078fd2eec7b got rid of Numeral.bin type
haftmann
parents: 20453
diff changeset
   975
22126
wenzelm
parents: 22125
diff changeset
   976
* New top level command 'normal_form' computes the normal form of a
wenzelm
parents: 22125
diff changeset
   977
term that may contain free variables. For example ``normal_form
wenzelm
parents: 22125
diff changeset
   978
"rev[a,b,c]"'' produces ``[b,c,a]'' (without proof).  This command is
wenzelm
parents: 22125
diff changeset
   979
suitable for heavy-duty computations because the functions are
wenzelm
parents: 22125
diff changeset
   980
compiled to ML first.
19895
cab56c949350 *** empty log message ***
nipkow
parents: 19855
diff changeset
   981
17996
71f250e05e05 * HOL: alternative iff syntax;
wenzelm
parents: 17991
diff changeset
   982
* Alternative iff syntax "A <-> B" for equality on bool (with priority
71f250e05e05 * HOL: alternative iff syntax;
wenzelm
parents: 17991
diff changeset
   983
25 like -->); output depends on the "iff" print_mode, the default is
71f250e05e05 * HOL: alternative iff syntax;
wenzelm
parents: 17991
diff changeset
   984
"A = B" (with priority 50).
71f250e05e05 * HOL: alternative iff syntax;
wenzelm
parents: 17991
diff changeset
   985
19279
48b527d0331b Renamed setsum_mult to setsum_right_distrib.
ballarin
parents: 19277
diff changeset
   986
* Renamed constants in HOL.thy and Orderings.thy:
22997
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   987
    op +   ~> HOL.plus_class.plus
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   988
    op -   ~> HOL.minus_class.minus
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   989
    uminus ~> HOL.minus_class.uminus
23881
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23850
diff changeset
   990
    abs    ~> HOL.abs_class.abs
22997
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
   991
    op *   ~> HOL.times_class.times
23881
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23850
diff changeset
   992
    op <   ~> HOL.ord_class.less
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23850
diff changeset
   993
    op <=  ~> HOL.ord_class.less_eq
19233
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19226
diff changeset
   994
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19226
diff changeset
   995
Adaptions may be required in the following cases:
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19226
diff changeset
   996
19377
1f717bd6b7ea *** empty log message ***
nipkow
parents: 19363
diff changeset
   997
a) User-defined constants using any of the names "plus", "minus", "times",
1f717bd6b7ea *** empty log message ***
nipkow
parents: 19363
diff changeset
   998
"less" or "less_eq". The standard syntax translations for "+", "-" and "*"
1f717bd6b7ea *** empty log message ***
nipkow
parents: 19363
diff changeset
   999
may go wrong.
19233
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19226
diff changeset
  1000
INCOMPATIBILITY: use more specific names.
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19226
diff changeset
  1001
19277
f7602e74d948 renamed op < <= to Orderings.less(_eq)
haftmann
parents: 19263
diff changeset
  1002
b) Variables named "plus", "minus", "times", "less", "less_eq"
19233
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19226
diff changeset
  1003
INCOMPATIBILITY: use more specific names.
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19226
diff changeset
  1004
19377
1f717bd6b7ea *** empty log message ***
nipkow
parents: 19363
diff changeset
  1005
c) Permutative equations (e.g. "a + b = b + a")
1f717bd6b7ea *** empty log message ***
nipkow
parents: 19363
diff changeset
  1006
Since the change of names also changes the order of terms, permutative
1f717bd6b7ea *** empty log message ***
nipkow
parents: 19363
diff changeset
  1007
rewrite rules may get applied in a different order. Experience shows that
1f717bd6b7ea *** empty log message ***
nipkow
parents: 19363
diff changeset
  1008
this is rarely the case (only two adaptions in the whole Isabelle
1f717bd6b7ea *** empty log message ***
nipkow
parents: 19363
diff changeset
  1009
distribution).
1f717bd6b7ea *** empty log message ***
nipkow
parents: 19363
diff changeset
  1010
INCOMPATIBILITY: rewrite proofs
19233
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19226
diff changeset
  1011
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19226
diff changeset
  1012
d) ML code directly refering to constant names
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19226
diff changeset
  1013
This in general only affects hand-written proof tactics, simprocs and so on.
22997
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
  1014
INCOMPATIBILITY: grep your sourcecode and replace names.  Consider use
d4f3b015b50b canonical prefixing of class constants
haftmann
parents: 22972
diff changeset
  1015
of const_name ML antiquotations.
19233
77ca20b0ed77 renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents: 19226
diff changeset
  1016
21265
b8db43faaf9e HOL: less/less_eq on bool, modified syntax;
wenzelm
parents: 21256
diff changeset
  1017
* Relations less (<) and less_eq (<=) are also available on type bool.
b8db43faaf9e HOL: less/less_eq on bool, modified syntax;
wenzelm
parents: 21256
diff changeset
  1018
Modified syntax to disallow nesting without explicit parentheses,
b8db43faaf9e HOL: less/less_eq on bool, modified syntax;
wenzelm
parents: 21256
diff changeset
  1019
e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z".
b8db43faaf9e HOL: less/less_eq on bool, modified syntax;
wenzelm
parents: 21256
diff changeset
  1020
18674
98d380757893 *** empty log message ***
nipkow
parents: 18644
diff changeset
  1021
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
98d380757893 *** empty log message ***
nipkow
parents: 18644
diff changeset
  1022
20716
a6686a8e1b68 Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents: 20712
diff changeset
  1023
* Relation composition operator "op O" now has precedence 75 and binds
a6686a8e1b68 Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents: 20712
diff changeset
  1024
stronger than union and intersection. INCOMPATIBILITY.
a6686a8e1b68 Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents: 20712
diff changeset
  1025
22126
wenzelm
parents: 22125
diff changeset
  1026
* The old set interval syntax "{m..n(}" (and relatives) has been
wenzelm
parents: 22125
diff changeset
  1027
removed.  Use "{m..<n}" (and relatives) instead.
19377
1f717bd6b7ea *** empty log message ***
nipkow
parents: 19363
diff changeset
  1028
17865
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
  1029
* In the context of the assumption "~(s = t)" the Simplifier rewrites
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
  1030
"t = s" to False (by simproc "neq_simproc").  For backward
5b0c3dcfbad2 * antiquotations ML_type, ML_struct;
wenzelm
parents: 17809
diff changeset
  1031
compatibility this can be disabled by ML "reset use_neq_simproc".
17779
407bea05c2da added dummy variable binding;
wenzelm
parents: 17754
diff changeset
  1032
22126
wenzelm
parents: 22125
diff changeset
  1033
* "m dvd n" where m and n are numbers is evaluated to True/False by
wenzelm
parents: 22125
diff changeset
  1034
simp.
wenzelm
parents: 22125
diff changeset
  1035
wenzelm
parents: 22125
diff changeset
  1036
* Theorem Cons_eq_map_conv no longer declared as ``simp''.
19211
307dfa3f9e66 *** empty log message ***
nipkow
parents: 19088
diff changeset
  1037
19279
48b527d0331b Renamed setsum_mult to setsum_right_distrib.
ballarin
parents: 19277
diff changeset
  1038
* Theorem setsum_mult renamed to setsum_right_distrib.
48b527d0331b Renamed setsum_mult to setsum_right_distrib.
ballarin
parents: 19277
diff changeset
  1039
19211
307dfa3f9e66 *** empty log message ***
nipkow
parents: 19088
diff changeset
  1040
* Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
22126
wenzelm
parents: 22125
diff changeset
  1041
``rule'' method.
wenzelm
parents: 22125
diff changeset
  1042
wenzelm
parents: 22125
diff changeset
  1043
* Reimplemented methods ``sat'' and ``satx'', with several
wenzelm
parents: 22125
diff changeset
  1044
improvements: goals no longer need to be stated as "<prems> ==>
wenzelm
parents: 22125
diff changeset
  1045
False", equivalences (i.e. "=" on type bool) are handled, variable
wenzelm
parents: 22125
diff changeset
  1046
names of the form "lit_<n>" are no longer reserved, significant
wenzelm
parents: 22125
diff changeset
  1047
speedup.
wenzelm
parents: 22125
diff changeset
  1048
wenzelm
parents: 22125
diff changeset
  1049
* Methods ``sat'' and ``satx'' can now replay MiniSat proof traces.
wenzelm
parents: 22125
diff changeset
  1050
zChaff is still supported as well.
wenzelm
parents: 22125
diff changeset
  1051
wenzelm
parents: 22125
diff changeset
  1052
* 'inductive' and 'datatype': provide projections of mutual rules,
wenzelm
parents: 22125
diff changeset
  1053
bundled as foo_bar.inducts;
wenzelm
parents: 22125
diff changeset
  1054
wenzelm
parents: 22125
diff changeset
  1055
* Library: moved theories Parity, GCD, Binomial, Infinite_Set to
wenzelm
parents: 22125
diff changeset
  1056
Library.
21256
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents: 21241
diff changeset
  1057
47195501ecf7 moved theories Parity, GCD, Binomial to Library;
wenzelm
parents: 21241
diff changeset
  1058
* Library: moved theory Accessible_Part to main HOL.
19572
a4b3176f19dd * Library: theory Accessible_Part has been move to main HOL.
wenzelm
parents: 19508
diff changeset
  1059
18446
wenzelm
parents: 18422
diff changeset
  1060
* Library: added theory Coinductive_List of potentially infinite lists
wenzelm
parents: 18422
diff changeset
  1061
as greatest fixed-point.
18399
651438736fa1 Provers/induct: coinduct;
wenzelm
parents: 18370
diff changeset
  1062
19254
efaf5d47049e Pure: no_translations;
wenzelm
parents: 19252
diff changeset
  1063
* Library: added theory AssocList which implements (finite) maps as
19252
1f7c69a5faac entry for Library/AssocList
schirmer
parents: 19240
diff changeset
  1064
association lists.
17809
195045659c06 Tactics sat and satx reimplemented, several improvements
webertj
parents: 17806
diff changeset
  1065
22126
wenzelm
parents: 22125
diff changeset
  1066
* Added proof method ``evaluation'' for efficiently solving a goal
wenzelm
parents: 22125
diff changeset
  1067
(i.e. a boolean expression) by compiling it to ML. The goal is
wenzelm
parents: 22125
diff changeset
  1068
"proved" (via an oracle) if it evaluates to True.
20807
wenzelm
parents: 20716
diff changeset
  1069
wenzelm
parents: 20716
diff changeset
  1070
* Linear arithmetic now splits certain operators (e.g. min, max, abs)
wenzelm
parents: 20716
diff changeset
  1071
also when invoked by the simplifier.  This results in the simplifier
21056
2cfe839e8d58 Symtab.foldl replaced by Symtab.fold
haftmann
parents: 21041
diff changeset
  1072
being more powerful on arithmetic goals.  INCOMPATIBILITY.  Set
20807
wenzelm
parents: 20716
diff changeset
  1073
fast_arith_split_limit to 0 to obtain the old behavior.
20217
25b068a99d2b linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents: 20188
diff changeset
  1074
22126
wenzelm
parents: 22125
diff changeset
  1075
* Support for hex (0x20) and binary (0b1001) numerals.
19254
efaf5d47049e Pure: no_translations;
wenzelm
parents: 19252
diff changeset
  1076
20807
wenzelm
parents: 20716
diff changeset
  1077
* New method: reify eqs (t), where eqs are equations for an
wenzelm
parents: 20716
diff changeset
  1078
interpretation I :: 'a list => 'b => 'c and t::'c is an optional
wenzelm
parents: 20716
diff changeset
  1079
parameter, computes a term s::'b and a list xs::'a list and proves the
wenzelm
parents: 20716
diff changeset
  1080
theorem I xs s = t. This is also known as reification or quoting. The
wenzelm
parents: 20716
diff changeset
  1081
resulting theorem is applied to the subgoal to substitute t with I xs
wenzelm
parents: 20716
diff changeset
  1082
s.  If t is omitted, the subgoal itself is reified.
wenzelm
parents: 20716
diff changeset
  1083
wenzelm
parents: 20716
diff changeset
  1084
* New method: reflection corr_thm eqs (t). The parameters eqs and (t)
wenzelm
parents: 20716
diff changeset
  1085
are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
wenzelm
parents: 20716
diff changeset
  1086
where f is supposed to be a computable function (in the sense of code
wenzelm
parents: 20716
diff changeset
  1087
generattion). The method uses reify to compute s and xs as above then
wenzelm
parents: 20716
diff changeset
  1088
applies corr_thm and uses normalization by evaluation to "prove" f s =
wenzelm
parents: 20716
diff changeset
  1089
r and finally gets the theorem t = r, which is again applied to the
wenzelm
parents: 20716
diff changeset
  1090
subgoal. An Example is available in HOL/ex/ReflectionEx.thy.
wenzelm
parents: 20716
diff changeset
  1091
23881
851c74f1bb69 moved class ord from Orderings.thy to HOL.thy
haftmann
parents: 23850
diff changeset
  1092
* Reflection: Automatic reification now handels binding, an example
20807
wenzelm
parents: 20716
diff changeset
  1093
is available in HOL/ex/ReflectionEx.thy
wenzelm
parents: 20716
diff changeset
  1094
wenzelm
parents: 20716
diff changeset
  1095
20169
52173f7687fd Change to algebra method.
ballarin
parents: 20136
diff changeset
  1096
*** HOL-Algebra ***
52173f7687fd Change to algebra method.
ballarin
parents: 20136
diff changeset
  1097
21170
wenzelm
parents: 21125
diff changeset
  1098
* Formalisation of ideals and the quotient construction over rings.
wenzelm
parents: 21125
diff changeset
  1099
wenzelm
parents: 21125
diff changeset
  1100
* Order and lattice theory no longer based on records.
wenzelm
parents: 21125
diff changeset
  1101
INCOMPATIBILITY.
wenzelm
parents: 21125
diff changeset
  1102
22126
wenzelm
parents: 22125
diff changeset
  1103
* Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
wenzelm
parents: 22125
diff changeset
  1104
greatest_closed.  INCOMPATIBILITY.
21896
9a7949815a84 Experimenting with interpretations of "definition".
ballarin
parents: 21879
diff changeset
  1105
21170
wenzelm
parents: 21125
diff changeset
  1106
* Method algebra is now set up via an attribute.  For examples see
21896
9a7949815a84 Experimenting with interpretations of "definition".
ballarin
parents: 21879
diff changeset
  1107
Ring.thy.  INCOMPATIBILITY: the method is now weaker on combinations
21170
wenzelm
parents: 21125
diff changeset
  1108
of algebraic structures.
20318
0e0ea63fe768 Restructured algebra library, added ideals and quotient rings.
ballarin
parents: 20217
diff changeset
  1109
22126
wenzelm
parents: 22125
diff changeset
  1110
* Renamed theory CRing to Ring.
20169
52173f7687fd Change to algebra method.
ballarin
parents: 20136
diff changeset
  1111
20807
wenzelm
parents: 20716
diff changeset
  1112
19653
39c37e16f748 * Pure/library: divide_and_conquer;
wenzelm
parents: 19625
diff changeset
  1113
*** HOL-Complex ***
39c37e16f748 * Pure/library: divide_and_conquer;
wenzelm
parents: 19625
diff changeset
  1114
39c37e16f748 * Pure/library: divide_and_conquer;
wenzelm
parents: 19625
diff changeset
  1115
* Theory Real: new method ferrack implements quantifier elimination
39c37e16f748 * Pure/library: divide_and_conquer;
wenzelm
parents: 19625
diff changeset
  1116
for linear arithmetic over the reals. The quantifier elimination
39c37e16f748 * Pure/library: divide_and_conquer;
wenzelm
parents: 19625
diff changeset
  1117
feature is used only for decision, for compatibility with arith. This
39c37e16f748 * Pure/library: divide_and_conquer;
wenzelm
parents: 19625
diff changeset
  1118
means a goal is either solved or left unchanged, no simplification.
39c37e16f748 * Pure/library: divide_and_conquer;
wenzelm
parents: 19625
diff changeset
  1119
22971
a6812b6a36a5 root and sqrt on negative inputs
huffman
parents: 22965
diff changeset
  1120
* Hyperreal: Functions root and sqrt are now defined on negative real
a6812b6a36a5 root and sqrt on negative inputs
huffman
parents: 22965
diff changeset
  1121
inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
a6812b6a36a5 root and sqrt on negative inputs
huffman
parents: 22965
diff changeset
  1122
Nonnegativity side conditions have been removed from many lemmas, so
a6812b6a36a5 root and sqrt on negative inputs
huffman
parents: 22965
diff changeset
  1123
that more subgoals may now be solved by simplification; potential
a6812b6a36a5 root and sqrt on negative inputs
huffman
parents: 22965
diff changeset
  1124
INCOMPATIBILITY.
a6812b6a36a5 root and sqrt on negative inputs
huffman
parents: 22965
diff changeset
  1125
21791
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1126
* Real: New axiomatic classes formalize real normed vector spaces and
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1127
algebras, using new overloaded constants scaleR :: real => 'a => 'a
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1128
and norm :: 'a => real.
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1129
22126
wenzelm
parents: 22125
diff changeset
  1130
* Real: New constant of_real :: real => 'a::real_algebra_1 injects
wenzelm
parents: 22125
diff changeset
  1131
from reals into other types. The overloaded constant Reals :: 'a set
wenzelm
parents: 22125
diff changeset
  1132
is now defined as range of_real; potential INCOMPATIBILITY.
wenzelm
parents: 22125
diff changeset
  1133
23013
c38c9039dc13 *** empty log message ***
nipkow
parents: 22997
diff changeset
  1134
* Real: ML code generation is supported now and hence also quickcheck.
c38c9039dc13 *** empty log message ***
nipkow
parents: 22997
diff changeset
  1135
Reals are implemented as arbitrary precision rationals.
c38c9039dc13 *** empty log message ***
nipkow
parents: 22997
diff changeset
  1136
22126
wenzelm
parents: 22125
diff changeset
  1137
* Hyperreal: Several constants that previously worked only for the
wenzelm
parents: 22125
diff changeset
  1138
reals have been generalized, so they now work over arbitrary vector
wenzelm
parents: 22125
diff changeset
  1139
spaces. Type annotations may need to be added in some cases; potential
wenzelm
parents: 22125
diff changeset
  1140
INCOMPATIBILITY.
21791
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1141
22972
3e96b98d37c6 generalized sgn function to work on any real normed vector space
huffman
parents: 22971
diff changeset
  1142
  Infinitesimal  :: ('a::real_normed_vector) star set
3e96b98d37c6 generalized sgn function to work on any real normed vector space
huffman
parents: 22971
diff changeset
  1143
  HFinite        :: ('a::real_normed_vector) star set
3e96b98d37c6 generalized sgn function to work on any real normed vector space
huffman
parents: 22971
diff changeset
  1144
  HInfinite      :: ('a::real_normed_vector) star set
21791
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1145
  approx         :: ('a::real_normed_vector) star => 'a star => bool
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1146
  monad          :: ('a::real_normed_vector) star => 'a star set
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1147
  galaxy         :: ('a::real_normed_vector) star => 'a star set
22972
3e96b98d37c6 generalized sgn function to work on any real normed vector space
huffman
parents: 22971
diff changeset
  1148
  (NS)LIMSEQ     :: [nat => 'a::real_normed_vector, 'a] => bool
21791
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1149
  (NS)convergent :: (nat => 'a::real_normed_vector) => bool
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1150
  (NS)Bseq       :: (nat => 'a::real_normed_vector) => bool
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1151
  (NS)Cauchy     :: (nat => 'a::real_normed_vector) => bool
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1152
  (NS)LIM        :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1153
  is(NS)Cont     :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1154
  deriv          :: ['a::real_normed_field => 'a, 'a, 'a] => bool
22972
3e96b98d37c6 generalized sgn function to work on any real normed vector space
huffman
parents: 22971
diff changeset
  1155
  sgn            :: 'a::real_normed_vector => 'a
23116
16e1401afe91 Complex: generalized type of exp
huffman
parents: 23104
diff changeset
  1156
  exp            :: 'a::{recpower,real_normed_field,banach} => 'a
21791
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1157
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1158
* Complex: Some complex-specific constants are now abbreviations for
22126
wenzelm
parents: 22125
diff changeset
  1159
overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
wenzelm
parents: 22125
diff changeset
  1160
hnorm.  Other constants have been entirely removed in favor of the
wenzelm
parents: 22125
diff changeset
  1161
polymorphic versions (INCOMPATIBILITY):
21791
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1162
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1163
  approx        <-- capprox
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1164
  HFinite       <-- CFinite
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1165
  HInfinite     <-- CInfinite
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1166
  Infinitesimal <-- CInfinitesimal
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1167
  monad         <-- cmonad
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1168
  galaxy        <-- cgalaxy
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1169
  (NS)LIM       <-- (NS)CLIM, (NS)CRLIM
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1170
  is(NS)Cont    <-- is(NS)Contc, is(NS)contCR
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1171
  (ns)deriv     <-- (ns)cderiv
367477e8458b additions to HOL-Complex
huffman
parents: 21735
diff changeset
  1172
19653
39c37e16f748 * Pure/library: divide_and_conquer;
wenzelm
parents: 19625
diff changeset
  1173
17878
wenzelm
parents: 17869
diff changeset
  1174
*** ML ***
wenzelm
parents: 17869
diff changeset
  1175
23251
471b576aad25 moved generic algebra modules
haftmann
parents: 23210
diff changeset
  1176
* Generic arithmetic modules: Tools/integer.ML, Tools/rat.ML, Tools/float.ML
471b576aad25 moved generic algebra modules
haftmann
parents: 23210
diff changeset
  1177
22848
f65a76867179 * Context data interfaces;
wenzelm
parents: 22845
diff changeset
  1178
* Context data interfaces (Theory/Proof/GenericDataFun): removed
22863
e1d3fa78b8e1 tuned context data;
wenzelm
parents: 22848
diff changeset
  1179
name/print, uninitialized data defaults to ad-hoc copy of empty value,
e1d3fa78b8e1 tuned context data;
wenzelm
parents: 22848
diff changeset
  1180
init only required for impure data.  INCOMPATIBILITY: empty really
e1d3fa78b8e1 tuned context data;
wenzelm
parents: 22848
diff changeset
  1181
need to be empty (no dependencies on theory content!)
22848
f65a76867179 * Context data interfaces;
wenzelm
parents: 22845
diff changeset
  1182
22138
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1183
* ML within Isar: antiquotations allow to embed statically-checked
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1184
formal entities in the source, referring to the context available at
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1185
compile-time.  For example:
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1186
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1187
ML {* @{typ "'a => 'b"} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1188
ML {* @{term "%x. x"} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1189
ML {* @{prop "x == y"} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1190
ML {* @{ctyp "'a => 'b"} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1191
ML {* @{cterm "%x. x"} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1192
ML {* @{cprop "x == y"} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1193
ML {* @{thm asm_rl} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1194
ML {* @{thms asm_rl} *}
22376
b711c2ad7507 added @{const_name}, @{const_syntax};
wenzelm
parents: 22316
diff changeset
  1195
ML {* @{const_name c} *}
b711c2ad7507 added @{const_name}, @{const_syntax};
wenzelm
parents: 22316
diff changeset
  1196
ML {* @{const_syntax c} *}
22138
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1197
ML {* @{context} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1198
ML {* @{theory} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1199
ML {* @{theory Pure} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1200
ML {* @{simpset} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1201
ML {* @{claset} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1202
ML {* @{clasimpset} *}
b9cbcd8be40f * ML within Isar: antiquotations;
wenzelm
parents: 22126
diff changeset
  1203
22151
wenzelm
parents: 22138
diff changeset
  1204
The same works for sources being ``used'' within an Isar context.
wenzelm
parents: 22138
diff changeset
  1205
22152
df787d582323 * ML in Isar: improved error reporting;
wenzelm
parents: 22151
diff changeset
  1206
* ML in Isar: improved error reporting; extra verbosity with
df787d582323 * ML in Isar: improved error reporting;
wenzelm
parents: 22151
diff changeset
  1207
Toplevel.debug enabled.
df787d582323 * ML in Isar: improved error reporting;
wenzelm
parents: 22151
diff changeset
  1208
20348
d59364649bcc abandoned equal_list in favor for eq_list
haftmann
parents: 20327
diff changeset
  1209
* Pure/library:
d59364649bcc abandoned equal_list in favor for eq_list
haftmann
parents: 20327
diff changeset
  1210
18450
e57731ba01dd discontinued unflat in favour of burrow and burrow_split
haftmann
parents: 18446
diff changeset
  1211
  val burrow: ('a list -> 'b list) -> 'a list list -> 'b list list
18549
5308a6ea3b96 rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents: 18540
diff changeset
  1212
  val fold_burrow: ('a list -> 'c -> 'b list * 'd) -> 'a list list -> 'c -> 'b list list * 'd
18450
e57731ba01dd discontinued unflat in favour of burrow and burrow_split
haftmann
parents: 18446
diff changeset
  1213
18540
7b6f57406b1b * Pure/Isar: new command 'unfolding';
wenzelm
parents: 18536
diff changeset
  1214
The semantics of "burrow" is: "take a function with *simulatanously*
7b6f57406b1b * Pure/Isar: new command 'unfolding';
wenzelm
parents: 18536
diff changeset
  1215
transforms a list of value, and apply it *simulatanously* to a list of
22126
wenzelm
parents: 22125
diff changeset
  1216
list of values of the appropriate type". Compare this with "map" which
18540
7b6f57406b1b * Pure/Isar: new command 'unfolding';
wenzelm
parents: 18536
diff changeset
  1217
would *not* apply its argument function simulatanously but in
22126
wenzelm
parents: 22125
diff changeset
  1218
sequence; "fold_burrow" has an additional context.
18450
e57731ba01dd discontinued unflat in favour of burrow and burrow_split
haftmann
parents: 18446
diff changeset
  1219
18446
wenzelm
parents: 18422
diff changeset
  1220
* Pure/library: functions map2 and fold2 with curried syntax for
wenzelm
parents: 18422
diff changeset
  1221
simultanous mapping and folding:
wenzelm
parents: 18422
diff changeset
  1222
18422
875451c9d253 re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents: 18399
diff changeset
  1223
    val map2: ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
875451c9d253 re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents: 18399
diff changeset
  1224
    val fold2: ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c
875451c9d253 re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents: 18399
diff changeset
  1225
18446
wenzelm
parents: 18422
diff changeset
  1226
* Pure/library: indexed lists - some functions in the Isabelle library
wenzelm
parents: 18422
diff changeset
  1227
treating lists over 'a as finite mappings from [0...n] to 'a have been
wenzelm
parents: 18422
diff changeset
  1228
given more convenient names and signatures reminiscent of similar
wenzelm
parents: 18422
diff changeset
  1229
functions for alists, tables, etc:
18051
dba086ed50cb nth_*, fold_index refined
haftmann
parents: 18044
diff changeset
  1230
dba086ed50cb nth_*, fold_index refined
haftmann
parents: 18044
diff changeset
  1231
  val nth: 'a list -> int -> 'a 
dba086ed50cb nth_*, fold_index refined
haftmann
parents: 18044
diff changeset
  1232
  val nth_map: int -> ('a -> 'a) -> 'a list -> 'a list
dba086ed50cb nth_*, fold_index refined
haftmann
parents: 18044
diff changeset
  1233
  val fold_index: (int * 'a -> 'b -> 'b) -> 'a list -> 'b -> 'b
dba086ed50cb nth_*, fold_index refined
haftmann
parents: 18044
diff changeset
  1234
18446
wenzelm
parents: 18422
diff changeset
  1235
Note that fold_index starts counting at index 0, not 1 like foldln
wenzelm
parents: 18422
diff changeset
  1236
used to.
wenzelm
parents: 18422
diff changeset
  1237
22126
wenzelm
parents: 22125
diff changeset
  1238
* Pure/library: added general ``divide_and_conquer'' combinator on
wenzelm
parents: 22125
diff changeset
  1239
lists.
19032
wenzelm
parents: 19006
diff changeset
  1240
wenzelm
parents: 19006
diff changeset
  1241
* Pure/General/table.ML: the join operations now works via exceptions
19081
085b5badb8de * Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents: 19034
diff changeset
  1242
DUP/SAME instead of type option.  This is simpler in simple cases, and
085b5badb8de * Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents: 19034
diff changeset
  1243
admits slightly more efficient complex applications.
18446
wenzelm
parents: 18422
diff changeset
  1244
18642
6954633b6a76 * ML: generic context, data, attributes;
wenzelm
parents: 18601
diff changeset
  1245
* Pure: datatype Context.generic joins theory/Proof.context and
18644
wenzelm
parents: 18642
diff changeset
  1246
provides some facilities for code that works in either kind of
18642
6954633b6a76 * ML: generic context, data, attributes;
wenzelm
parents: 18601
diff changeset
  1247
context, notably GenericDataFun for uniform theory and proof data.
6954633b6a76 * ML: generic context, data, attributes;
wenzelm
parents: 18601
diff changeset
  1248
18862
bd83590be0f7 * Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents: 18815
diff changeset
  1249
* Pure: 'advanced' translation functions (parse_translation etc.) now
bd83590be0f7 * Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents: 18815
diff changeset
  1250
use Context.generic instead of just theory.
bd83590be0f7 * Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents: 18815
diff changeset
  1251
18737
78d6ae887f6e * ML: simplified type attribute;
wenzelm
parents: 18722
diff changeset
  1252
* Pure: simplified internal attribute type, which is now always
78d6ae887f6e * ML: simplified type attribute;
wenzelm
parents: 18722
diff changeset
  1253
Context.generic * thm -> Context.generic * thm.  Global (theory)
78d6ae887f6e * ML: simplified type attribute;
wenzelm
parents: 18722
diff changeset
  1254
vs. local (Proof.context) attributes have been discontinued, while
18738
wenzelm
parents: 18737
diff changeset
  1255
minimizing code duplication.  Thm.rule_attribute and
wenzelm
parents: 18737
diff changeset
  1256
Thm.declaration_attribute build canonical attributes; see also
19006
2427684c201c * ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents: 18979
diff changeset
  1257
structure Context for further operations on Context.generic, notably
2427684c201c * ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents: 18979
diff changeset
  1258
GenericDataFun.  INCOMPATIBILITY, need to adapt attribute type
2427684c201c * ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents: 18979
diff changeset
  1259
declarations and definitions.
2427684c201c * ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents: 18979
diff changeset
  1260
19508
d5236f5b0a71 * Pure: axclasses now purely definitional;
wenzelm
parents: 19377
diff changeset
  1261
* Pure/kernel: consts certification ignores sort constraints given in
d5236f5b0a71 * Pure: axclasses now purely definitional;
wenzelm
parents: 19377
diff changeset
  1262
signature declarations.  (This information is not relevant to the
22126
wenzelm
parents: 22125
diff changeset
  1263
logic, but only for type inference.)  IMPORTANT INTERNAL CHANGE,
wenzelm
parents: 22125
diff changeset
  1264
potential INCOMPATIBILITY.
19508
d5236f5b0a71 * Pure: axclasses now purely definitional;
wenzelm
parents: 19377
diff changeset
  1265
d5236f5b0a71 * Pure: axclasses now purely definitional;
wenzelm
parents: 19377
diff changeset
  1266
* Pure: axiomatic type classes are now purely definitional, with
d5236f5b0a71 * Pure: axclasses now purely definitional;
wenzelm
parents: 19377
diff changeset
  1267
explicit proofs of class axioms and super class relations performed
d5236f5b0a71 * Pure: axclasses now purely definitional;
wenzelm
parents: 19377
diff changeset
  1268
internally.  See Pure/axclass.ML for the main internal interfaces --
d5236f5b0a71 * Pure: axclasses now purely definitional;
wenzelm
parents: 19377
diff changeset
  1269
notably AxClass.define_class supercedes AxClass.add_axclass, and
d5236f5b0a71 * Pure: axclasses now purely definitional;
wenzelm
parents: 19377
diff changeset
  1270
AxClass.axiomatize_class/classrel/arity supercede
d5236f5b0a71 * Pure: axclasses now purely definitional;
wenzelm
parents: 19377
diff changeset
  1271
Sign.add_classes/classrel/arities.
d5236f5b0a71 * Pure: axclasses now purely definitional;
wenzelm
parents: 19377
diff changeset
  1272
19006
2427684c201c * ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents: 18979
diff changeset
  1273
* Pure/Isar: Args/Attrib parsers operate on Context.generic --
2427684c201c * ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents: 18979
diff changeset
  1274
global/local versions on theory vs. Proof.context have been
2427684c201c * ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents: 18979
diff changeset
  1275
discontinued; Attrib.syntax and Method.syntax have been adapted
2427684c201c * ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents: 18979
diff changeset
  1276
accordingly.  INCOMPATIBILITY, need to adapt parser expressions for
2427684c201c * ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents: 18979
diff changeset
  1277
attributes, methods, etc.
18642
6954633b6a76 * ML: generic context, data, attributes;
wenzelm
parents: 18601
diff changeset
  1278
18446
wenzelm
parents: 18422
diff changeset
  1279
* Pure: several functions of signature "... -> theory -> theory * ..."
wenzelm
parents: 18422
diff changeset
  1280
have been reoriented to "... -> theory -> ... * theory" in order to
wenzelm
parents: 18422
diff changeset
  1281
allow natural usage in combination with the ||>, ||>>, |-> and
wenzelm
parents: 18422
diff changeset
  1282
fold_map combinators.
18051
dba086ed50cb nth_*, fold_index refined
haftmann
parents: 18044
diff changeset
  1283
21647
fccafa917a68 * Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents: 21595
diff changeset
  1284
* Pure: official theorem names (closed derivations) and additional
fccafa917a68 * Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents: 21595
diff changeset
  1285
comments (tags) are now strictly separate.  Name hints -- which are
fccafa917a68 * Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents: 21595
diff changeset
  1286
maintained as tags -- may be attached any time without affecting the
fccafa917a68 * Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents: 21595
diff changeset
  1287
derivation.
fccafa917a68 * Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents: 21595
diff changeset
  1288
18020
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
  1289
* Pure: primitive rule lift_rule now takes goal cterm instead of an
18145
6757627acf59 renamed Thm.cgoal_of to Thm.cprem_of;
wenzelm
parents: 18051
diff changeset
  1290
actual goal state (thm).  Use Thm.lift_rule (Thm.cprem_of st i) to
18020
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
  1291
achieve the old behaviour.
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
  1292
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
  1293
* Pure: the "Goal" constant is now called "prop", supporting a
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
  1294
slightly more general idea of ``protecting'' meta-level rule
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
  1295
statements.
d23a846598d2 * Pure/Isar: literal facts;
wenzelm
parents: 17996
diff changeset
  1296
20040
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1297
* Pure: Logic.(un)varify only works in a global context, which is now
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1298
enforced instead of silently assumed.  INCOMPATIBILITY, may use
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1299
Logic.legacy_(un)varify as temporary workaround.
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1300
20090
5cf221f2a55d * Pure: structure Name;
wenzelm
parents: 20067
diff changeset
  1301
* Pure: structure Name provides scalable operations for generating
5cf221f2a55d * Pure: structure Name;
wenzelm
parents: 20067
diff changeset
  1302
internal variable names, notably Name.variants etc.  This replaces
5cf221f2a55d * Pure: structure Name;
wenzelm
parents: 20067
diff changeset
  1303
some popular functions from term.ML:
5cf221f2a55d * Pure: structure Name;
wenzelm
parents: 20067
diff changeset
  1304
5cf221f2a55d * Pure: structure Name;
wenzelm
parents: 20067
diff changeset
  1305
  Term.variant		->  Name.variant
5cf221f2a55d * Pure: structure Name;
wenzelm
parents: 20067
diff changeset
  1306
  Term.variantlist	->  Name.variant_list  (*canonical argument order*)
5cf221f2a55d * Pure: structure Name;
wenzelm
parents: 20067
diff changeset
  1307
  Term.invent_names	->  Name.invent_list
5cf221f2a55d * Pure: structure Name;
wenzelm
parents: 20067
diff changeset
  1308
5cf221f2a55d * Pure: structure Name;
wenzelm
parents: 20067
diff changeset
  1309
Note that low-level renaming rarely occurs in new code -- operations
5cf221f2a55d * Pure: structure Name;
wenzelm
parents: 20067
diff changeset
  1310
from structure Variable are used instead (see below).
5cf221f2a55d * Pure: structure Name;
wenzelm
parents: 20067
diff changeset
  1311
20040
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1312
* Pure: structure Variable provides fundamental operations for proper
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1313
treatment of fixed/schematic variables in a context.  For example,
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1314
Variable.import introduces fixes for schematics of given facts and
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1315
Variable.export reverses the effect (up to renaming) -- this replaces
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1316
various freeze_thaw operations.
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1317
18567
ecdd71518f33 * Pure/Isar: Toplevel.theory_theory_to_proof;
wenzelm
parents: 18557
diff changeset
  1318
* Pure: structure Goal provides simple interfaces for
17981
2602be0d99ae * Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents: 17918
diff changeset
  1319
init/conclude/finish and tactical prove operations (replacing former
20040
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1320
Tactic.prove).  Goal.prove is the canonical way to prove results
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1321
within a given context; Goal.prove_global is a degraded version for
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1322
theory level goals, including a global Drule.standard.  Note that
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1323
OldGoals.prove_goalw_cterm has long been obsolete, since it is
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1324
ill-behaved in a local proof context (e.g. with local fixes/assumes or
02c59ec2f2e1 * Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents: 20013
diff changeset
  1325
in a locale context).
17981
2602be0d99ae * Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents: 17918
diff changeset
  1326
18815
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
  1327
* Isar: simplified treatment of user-level errors, using exception
18687
wenzelm
parents: 18686
diff changeset
  1328
ERROR of string uniformly.  Function error now merely raises ERROR,
18686
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1329
without any side effect on output channels.  The Isar toplevel takes
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1330
care of proper display of ERROR exceptions.  ML code may use plain
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1331
handle/can/try; cat_error may be used to concatenate errors like this:
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1332
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1333
  ... handle ERROR msg => cat_error msg "..."
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1334
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1335
Toplevel ML code (run directly or through the Isar toplevel) may be
18687
wenzelm
parents: 18686
diff changeset
  1336
embedded into the Isar toplevel with exception display/debug like
wenzelm
parents: 18686
diff changeset
  1337
this:
18686
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1338
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1339
  Isar.toplevel (fn () => ...)
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1340
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1341
INCOMPATIBILITY, removed special transform_error facilities, removed
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1342
obsolete variants of user-level exceptions (ERROR_MESSAGE,
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1343
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1344
-- use plain ERROR instead.
cbbc71acf994 * ML/Isar: simplified treatment of user-level errors;
wenzelm
parents: 18674
diff changeset
  1345
18815
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
  1346
* Isar: theory setup now has type (theory -> theory), instead of a
18722
0888eca0f1be * ML/Isar: theory setup has type (theory -> theory);
wenzelm
parents: 18696
diff changeset
  1347
list.  INCOMPATIBILITY, may use #> to compose setup functions.
0888eca0f1be * ML/Isar: theory setup has type (theory -> theory);
wenzelm
parents: 18696
diff changeset
  1348
18815
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
  1349
* Isar: installed ML toplevel pretty printer for type Proof.context,
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
  1350
subject to ProofContext.debug/verbose flags.
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
  1351
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
  1352
* Isar: Toplevel.theory_to_proof admits transactions that modify the
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
  1353
theory before entering a proof state.  Transactions now always see a
cb778c0ce1b5 Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents: 18738
diff changeset
  1354
quasi-functional intermediate checkpoint, both in interactive and
18590
f6a553aa3d81 Pure/Isar: Toplevel.theory_to_proof admits transactions that modify the theory;
wenzelm
parents: 18568
diff changeset
  1355
batch mode.
18567
ecdd71518f33 * Pure/Isar: Toplevel.theory_theory_to_proof;
wenzelm
parents: 18557
diff changeset
  1356
17878
wenzelm
parents: 17869
diff changeset
  1357
* Simplifier: the simpset of a running simplification process now
wenzelm
parents: 17869
diff changeset
  1358
contains a proof context (cf. Simplifier.the_context), which is the
wenzelm
parents: 17869
diff changeset
  1359
very context that the initial simpset has been retrieved from (by
17890
fddb41d3cfa5 Simplifier.context/theory_context;
wenzelm
parents: 17887
diff changeset
  1360
simpset_of/local_simpset_of).  Consequently, all plug-in components
17878
wenzelm
parents: 17869
diff changeset
  1361
(solver, looper etc.) may depend on arbitrary proof data.
wenzelm
parents: 17869
diff changeset
  1362
wenzelm
parents: 17869
diff changeset
  1363
* Simplifier.inherit_context inherits the proof context (plus the
wenzelm
parents: 17869
diff changeset
  1364
local bounds) of the current simplification process; any simproc
wenzelm
parents: 17869
diff changeset
  1365
etc. that calls the Simplifier recursively should do this!  Removed
wenzelm
parents: 17869
diff changeset
  1366
former Simplifier.inherit_bounds, which is already included here --
17890
fddb41d3cfa5 Simplifier.context/theory_context;
wenzelm
parents: 17887
diff changeset
  1367
INCOMPATIBILITY.  Tools based on low-level rewriting may even have to
fddb41d3cfa5 Simplifier.context/theory_context;
wenzelm
parents: 17887
diff changeset
  1368
specify an explicit context using Simplifier.context/theory_context.
17878
wenzelm
parents: 17869
diff changeset
  1369
wenzelm
parents: 17869
diff changeset
  1370
* Simplifier/Classical Reasoner: more abstract interfaces
wenzelm
parents: 17869
diff changeset
  1371
change_simpset/claset for modifying the simpset/claset reference of a
wenzelm
parents: 17869
diff changeset
  1372
theory; raw versions simpset/claset_ref etc. have been discontinued --
wenzelm
parents: 17869
diff changeset
  1373
INCOMPATIBILITY.
wenzelm
parents: 17869
diff changeset
  1374
18540
7b6f57406b1b * Pure/Isar: new command 'unfolding';
wenzelm
parents: 18536
diff changeset
  1375
* Provers: more generic wrt. syntax of object-logics, avoid hardwired
7b6f57406b1b * Pure/Isar: new command 'unfolding';
wenzelm
parents: 18536
diff changeset
  1376
"Trueprop" etc.
7b6f57406b1b * Pure/Isar: new command 'unfolding';
wenzelm
parents: 18536
diff changeset
  1377
17878
wenzelm
parents: 17869
diff changeset
  1378
20988
0887d0dd3210 * isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents: 20951
diff changeset
  1379
*** System ***
0887d0dd3210 * isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents: 20951
diff changeset
  1380
21471
03a5ef1936c5 * settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents: 21462
diff changeset
  1381
* settings: ML_IDENTIFIER -- which is appended to user specific heap
03a5ef1936c5 * settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents: 21462
diff changeset
  1382
locations -- now includes the Isabelle version identifier as well.
03a5ef1936c5 * settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents: 21462
diff changeset
  1383
This simplifies use of multiple Isabelle installations.
03a5ef1936c5 * settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents: 21462
diff changeset
  1384
20988
0887d0dd3210 * isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents: 20951
diff changeset
  1385
* isabelle-process: option -S (secure mode) disables some critical
0887d0dd3210 * isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents: 20951
diff changeset
  1386
operations, notably runtime compilation and evaluation of ML source
0887d0dd3210 * isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents: 20951
diff changeset
  1387
code.
0887d0dd3210 * isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents: 20951
diff changeset
  1388
17754
58a306d9f736 * Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents: 17725
diff changeset
  1389
17720
da9199e6b674 Isabelle2005 (October 2005);
wenzelm
parents: 17701
diff changeset
  1390
New in Isabelle2005 (October 2005)
da9199e6b674 Isabelle2005 (October 2005);
wenzelm
parents: 17701
diff changeset
  1391
----------------------------------
14655
8a95abf87dd3 Pure: considerably improved version of 'constdefs' command;
wenzelm
parents: 14624
diff changeset
  1392
8a95abf87dd3 Pure: considerably improved version of 'constdefs' command;
wenzelm
parents: 14624
diff changeset
  1393
*** General ***
8a95abf87dd3 Pure: considerably improved version of 'constdefs' command;
wenzelm
parents: 14624
diff changeset
  1394
15130
dc6be28d7f4e *** empty log message ***
nipkow
parents: 15127
diff changeset
  1395
* Theory headers: the new header syntax for Isar theories is
dc6be28d7f4e *** empty log message ***
nipkow
parents: 15127
diff changeset
  1396
dc6be28d7f4e *** empty log message ***
nipkow
parents: 15127
diff changeset
  1397
  theory <name>
16234
421c3522f160 major reorganization and cleanup;
wenzelm
parents: 16181
diff changeset
  1398
  imports <theory1> ... <theoryN>
421c3522f160 major reorganization and cleanup;
wenzelm
parents: 16181
diff changeset
  1399
  uses <file1> ... <fileM>
15130
dc6be28d7f4e *** empty log message ***
nipkow
parents: 15127
diff changeset
  1400
  begin