author | wenzelm |
Sun, 29 Sep 2013 12:49:47 +0200 | |
changeset 53982 | f0ee92285221 |
parent 53219 | ca237b9e4542 |
child 54017 | 2a3c07f49615 |
permissions | -rw-r--r-- |
26840 | 1 |
theory HOL_Specific |
52895
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
2 |
imports Base Main "~~/src/HOL/Library/Old_Recdef" "~~/src/Tools/Adhoc_Overloading" |
26840 | 3 |
begin |
4 |
||
50109 | 5 |
chapter {* Higher-Order Logic *} |
42914 | 6 |
|
7 |
text {* Isabelle/HOL is based on Higher-Order Logic, a polymorphic |
|
8 |
version of Church's Simple Theory of Types. HOL can be best |
|
9 |
understood as a simply-typed version of classical set theory. The |
|
10 |
logic was first implemented in Gordon's HOL system |
|
11 |
\cite{mgordon-hol}. It extends Church's original logic |
|
12 |
\cite{church40} by explicit type variables (naive polymorphism) and |
|
13 |
a sound axiomatization scheme for new types based on subsets of |
|
14 |
existing types. |
|
15 |
||
16 |
Andrews's book \cite{andrews86} is a full description of the |
|
17 |
original Church-style higher-order logic, with proofs of correctness |
|
18 |
and completeness wrt.\ certain set-theoretic interpretations. The |
|
19 |
particular extensions of Gordon-style HOL are explained semantically |
|
20 |
in two chapters of the 1993 HOL book \cite{pitts93}. |
|
21 |
||
22 |
Experience with HOL over decades has demonstrated that higher-order |
|
23 |
logic is widely applicable in many areas of mathematics and computer |
|
24 |
science. In a sense, Higher-Order Logic is simpler than First-Order |
|
25 |
Logic, because there are fewer restrictions and special cases. Note |
|
26 |
that HOL is \emph{weaker} than FOL with axioms for ZF set theory, |
|
27 |
which is traditionally considered the standard foundation of regular |
|
28 |
mathematics, but for most applications this does not matter. If you |
|
29 |
prefer ML to Lisp, you will probably prefer HOL to ZF. |
|
30 |
||
31 |
\medskip The syntax of HOL follows @{text "\<lambda>"}-calculus and |
|
32 |
functional programming. Function application is curried. To apply |
|
33 |
the function @{text f} of type @{text "\<tau>\<^sub>1 \<Rightarrow> \<tau>\<^sub>2 \<Rightarrow> \<tau>\<^sub>3"} to the |
|
34 |
arguments @{text a} and @{text b} in HOL, you simply write @{text "f |
|
35 |
a b"} (as in ML or Haskell). There is no ``apply'' operator; the |
|
36 |
existing application of the Pure @{text "\<lambda>"}-calculus is re-used. |
|
37 |
Note that in HOL @{text "f (a, b)"} means ``@{text "f"} applied to |
|
38 |
the pair @{text "(a, b)"} (which is notation for @{text "Pair a |
|
39 |
b"}). The latter typically introduces extra formal efforts that can |
|
40 |
be avoided by currying functions by default. Explicit tuples are as |
|
41 |
infrequent in HOL formalizations as in good ML or Haskell programs. |
|
42 |
||
43 |
\medskip Isabelle/HOL has a distinct feel, compared to other |
|
44 |
object-logics like Isabelle/ZF. It identifies object-level types |
|
45 |
with meta-level types, taking advantage of the default |
|
46 |
type-inference mechanism of Isabelle/Pure. HOL fully identifies |
|
47 |
object-level functions with meta-level functions, with native |
|
48 |
abstraction and application. |
|
49 |
||
50 |
These identifications allow Isabelle to support HOL particularly |
|
51 |
nicely, but they also mean that HOL requires some sophistication |
|
52 |
from the user. In particular, an understanding of Hindley-Milner |
|
53 |
type-inference with type-classes, which are both used extensively in |
|
54 |
the standard libraries and applications. Beginners can set |
|
55 |
@{attribute show_types} or even @{attribute show_sorts} to get more |
|
56 |
explicit information about the result of type-inference. *} |
|
57 |
||
58 |
||
50109 | 59 |
chapter {* Derived specification elements *} |
60 |
||
42908 | 61 |
section {* Inductive and coinductive definitions \label{sec:hol-inductive} *} |
62 |
||
46280 | 63 |
text {* |
64 |
\begin{matharray}{rcl} |
|
65 |
@{command_def (HOL) "inductive"} & : & @{text "local_theory \<rightarrow> local_theory"} \\ |
|
66 |
@{command_def (HOL) "inductive_set"} & : & @{text "local_theory \<rightarrow> local_theory"} \\ |
|
67 |
@{command_def (HOL) "coinductive"} & : & @{text "local_theory \<rightarrow> local_theory"} \\ |
|
68 |
@{command_def (HOL) "coinductive_set"} & : & @{text "local_theory \<rightarrow> local_theory"} \\ |
|
50302 | 69 |
@{command_def "print_inductives"}@{text "\<^sup>*"} & : & @{text "context \<rightarrow>"} \\ |
46280 | 70 |
@{attribute_def (HOL) mono} & : & @{text attribute} \\ |
71 |
\end{matharray} |
|
72 |
||
73 |
An \emph{inductive definition} specifies the least predicate or set |
|
74 |
@{text R} closed under given rules: applying a rule to elements of |
|
75 |
@{text R} yields a result within @{text R}. For example, a |
|
76 |
structural operational semantics is an inductive definition of an |
|
77 |
evaluation relation. |
|
42908 | 78 |
|
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
79 |
Dually, a \emph{coinductive definition} specifies the greatest |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
80 |
predicate or set @{text R} that is consistent with given rules: |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
81 |
every element of @{text R} can be seen as arising by applying a rule |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
82 |
to elements of @{text R}. An important example is using |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
83 |
bisimulation relations to formalise equivalence of processes and |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
84 |
infinite data structures. |
47859 | 85 |
|
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
86 |
Both inductive and coinductive definitions are based on the |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
87 |
Knaster-Tarski fixed-point theorem for complete lattices. The |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
88 |
collection of introduction rules given by the user determines a |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
89 |
functor on subsets of set-theoretic relations. The required |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
90 |
monotonicity of the recursion scheme is proven as a prerequisite to |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
91 |
the fixed-point definition and the resulting consequences. This |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
92 |
works by pushing inclusion through logical connectives and any other |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
93 |
operator that might be wrapped around recursive occurrences of the |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
94 |
defined relation: there must be a monotonicity theorem of the form |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
95 |
@{text "A \<le> B \<Longrightarrow> \<M> A \<le> \<M> B"}, for each premise @{text "\<M> R t"} in an |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
96 |
introduction rule. The default rule declarations of Isabelle/HOL |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
97 |
already take care of most common situations. |
42907
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42705
diff
changeset
|
98 |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
99 |
@{rail " |
42908 | 100 |
(@@{command (HOL) inductive} | @@{command (HOL) inductive_set} | |
101 |
@@{command (HOL) coinductive} | @@{command (HOL) coinductive_set}) |
|
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
102 |
@{syntax target}? \\ |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
103 |
@{syntax \"fixes\"} (@'for' @{syntax \"fixes\"})? (@'where' clauses)? \\ |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
104 |
(@'monos' @{syntax thmrefs})? |
42908 | 105 |
; |
106 |
clauses: (@{syntax thmdecl}? @{syntax prop} + '|') |
|
107 |
; |
|
108 |
@@{attribute (HOL) mono} (() | 'add' | 'del') |
|
109 |
"} |
|
110 |
||
111 |
\begin{description} |
|
112 |
||
113 |
\item @{command (HOL) "inductive"} and @{command (HOL) |
|
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
114 |
"coinductive"} define (co)inductive predicates from the introduction |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
115 |
rules. |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
116 |
|
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
117 |
The propositions given as @{text "clauses"} in the @{keyword |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
118 |
"where"} part are either rules of the usual @{text "\<And>/\<Longrightarrow>"} format |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
119 |
(with arbitrary nesting), or equalities using @{text "\<equiv>"}. The |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
120 |
latter specifies extra-logical abbreviations in the sense of |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
121 |
@{command_ref abbreviation}. Introducing abstract syntax |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
122 |
simultaneously with the actual introduction rules is occasionally |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
123 |
useful for complex specifications. |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
124 |
|
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
125 |
The optional @{keyword "for"} part contains a list of parameters of |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
126 |
the (co)inductive predicates that remain fixed throughout the |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
127 |
definition, in contrast to arguments of the relation that may vary |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
128 |
in each occurrence within the given @{text "clauses"}. |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
129 |
|
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
130 |
The optional @{keyword "monos"} declaration contains additional |
42908 | 131 |
\emph{monotonicity theorems}, which are required for each operator |
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
132 |
applied to a recursive set in the introduction rules. |
42908 | 133 |
|
134 |
\item @{command (HOL) "inductive_set"} and @{command (HOL) |
|
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
135 |
"coinductive_set"} are wrappers for to the previous commands for |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
136 |
native HOL predicates. This allows to define (co)inductive sets, |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
137 |
where multiple arguments are simulated via tuples. |
42908 | 138 |
|
50302 | 139 |
\item @{command "print_inductives"} prints (co)inductive definitions and |
140 |
monotonicity rules. |
|
141 |
||
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
142 |
\item @{attribute (HOL) mono} declares monotonicity rules in the |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
143 |
context. These rule are involved in the automated monotonicity |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
144 |
proof of the above inductive and coinductive definitions. |
42908 | 145 |
|
146 |
\end{description} |
|
147 |
*} |
|
148 |
||
149 |
||
150 |
subsection {* Derived rules *} |
|
151 |
||
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
152 |
text {* A (co)inductive definition of @{text R} provides the following |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
153 |
main theorems: |
42908 | 154 |
|
155 |
\begin{description} |
|
156 |
||
157 |
\item @{text R.intros} is the list of introduction rules as proven |
|
158 |
theorems, for the recursive predicates (or sets). The rules are |
|
159 |
also available individually, using the names given them in the |
|
160 |
theory file; |
|
161 |
||
162 |
\item @{text R.cases} is the case analysis (or elimination) rule; |
|
163 |
||
164 |
\item @{text R.induct} or @{text R.coinduct} is the (co)induction |
|
44273
336752fb25df
adding documentation about simps equation in the inductive package
bulwahn
parents:
44055
diff
changeset
|
165 |
rule; |
336752fb25df
adding documentation about simps equation in the inductive package
bulwahn
parents:
44055
diff
changeset
|
166 |
|
336752fb25df
adding documentation about simps equation in the inductive package
bulwahn
parents:
44055
diff
changeset
|
167 |
\item @{text R.simps} is the equation unrolling the fixpoint of the |
336752fb25df
adding documentation about simps equation in the inductive package
bulwahn
parents:
44055
diff
changeset
|
168 |
predicate one step. |
47859 | 169 |
|
42908 | 170 |
\end{description} |
171 |
||
172 |
When several predicates @{text "R\<^sub>1, \<dots>, R\<^sub>n"} are |
|
173 |
defined simultaneously, the list of introduction rules is called |
|
174 |
@{text "R\<^sub>1_\<dots>_R\<^sub>n.intros"}, the case analysis rules are |
|
175 |
called @{text "R\<^sub>1.cases, \<dots>, R\<^sub>n.cases"}, and the list |
|
176 |
of mutual induction rules is called @{text |
|
177 |
"R\<^sub>1_\<dots>_R\<^sub>n.inducts"}. |
|
178 |
*} |
|
179 |
||
180 |
||
181 |
subsection {* Monotonicity theorems *} |
|
182 |
||
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
183 |
text {* The context maintains a default set of theorems that are used |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
184 |
in monotonicity proofs. New rules can be declared via the |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
185 |
@{attribute (HOL) mono} attribute. See the main Isabelle/HOL |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
186 |
sources for some examples. The general format of such monotonicity |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
187 |
theorems is as follows: |
42908 | 188 |
|
189 |
\begin{itemize} |
|
190 |
||
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
191 |
\item Theorems of the form @{text "A \<le> B \<Longrightarrow> \<M> A \<le> \<M> B"}, for proving |
42908 | 192 |
monotonicity of inductive definitions whose introduction rules have |
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
193 |
premises involving terms such as @{text "\<M> R t"}. |
42908 | 194 |
|
195 |
\item Monotonicity theorems for logical operators, which are of the |
|
196 |
general form @{text "(\<dots> \<longrightarrow> \<dots>) \<Longrightarrow> \<dots> (\<dots> \<longrightarrow> \<dots>) \<Longrightarrow> \<dots> \<longrightarrow> \<dots>"}. For example, in |
|
197 |
the case of the operator @{text "\<or>"}, the corresponding theorem is |
|
198 |
\[ |
|
199 |
\infer{@{text "P\<^sub>1 \<or> P\<^sub>2 \<longrightarrow> Q\<^sub>1 \<or> Q\<^sub>2"}}{@{text "P\<^sub>1 \<longrightarrow> Q\<^sub>1"} & @{text "P\<^sub>2 \<longrightarrow> Q\<^sub>2"}} |
|
200 |
\] |
|
201 |
||
202 |
\item De Morgan style equations for reasoning about the ``polarity'' |
|
203 |
of expressions, e.g. |
|
204 |
\[ |
|
205 |
@{prop "\<not> \<not> P \<longleftrightarrow> P"} \qquad\qquad |
|
206 |
@{prop "\<not> (P \<and> Q) \<longleftrightarrow> \<not> P \<or> \<not> Q"} |
|
207 |
\] |
|
208 |
||
209 |
\item Equations for reducing complex operators to more primitive |
|
210 |
ones whose monotonicity can easily be proved, e.g. |
|
211 |
\[ |
|
212 |
@{prop "(P \<longrightarrow> Q) \<longleftrightarrow> \<not> P \<or> Q"} \qquad\qquad |
|
213 |
@{prop "Ball A P \<equiv> \<forall>x. x \<in> A \<longrightarrow> P x"} |
|
214 |
\] |
|
215 |
||
216 |
\end{itemize} |
|
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
217 |
*} |
42908 | 218 |
|
42913
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
219 |
subsubsection {* Examples *} |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
220 |
|
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
221 |
text {* The finite powerset operator can be defined inductively like this: *} |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
222 |
|
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
223 |
inductive_set Fin :: "'a set \<Rightarrow> 'a set set" for A :: "'a set" |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
224 |
where |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
225 |
empty: "{} \<in> Fin A" |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
226 |
| insert: "a \<in> A \<Longrightarrow> B \<in> Fin A \<Longrightarrow> insert a B \<in> Fin A" |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
227 |
|
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
228 |
text {* The accessible part of a relation is defined as follows: *} |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
229 |
|
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
230 |
inductive acc :: "('a \<Rightarrow> 'a \<Rightarrow> bool) \<Rightarrow> 'a \<Rightarrow> bool" |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
231 |
for r :: "'a \<Rightarrow> 'a \<Rightarrow> bool" (infix "\<prec>" 50) |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
232 |
where acc: "(\<And>y. y \<prec> x \<Longrightarrow> acc r y) \<Longrightarrow> acc r x" |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
233 |
|
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
234 |
text {* Common logical connectives can be easily characterized as |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
235 |
non-recursive inductive definitions with parameters, but without |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
236 |
arguments. *} |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
237 |
|
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
238 |
inductive AND for A B :: bool |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
239 |
where "A \<Longrightarrow> B \<Longrightarrow> AND A B" |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
240 |
|
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
241 |
inductive OR for A B :: bool |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
242 |
where "A \<Longrightarrow> OR A B" |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
243 |
| "B \<Longrightarrow> OR A B" |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
244 |
|
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
245 |
inductive EXISTS for B :: "'a \<Rightarrow> bool" |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
246 |
where "B a \<Longrightarrow> EXISTS B" |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
247 |
|
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
248 |
text {* Here the @{text "cases"} or @{text "induct"} rules produced by |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
249 |
the @{command inductive} package coincide with the expected |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
250 |
elimination rules for Natural Deduction. Already in the original |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
251 |
article by Gerhard Gentzen \cite{Gentzen:1935} there is a hint that |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
252 |
each connective can be characterized by its introductions, and the |
68bc69bdce88
updated and re-unified (co)inductive definitions in HOL;
wenzelm
parents:
42912
diff
changeset
|
253 |
elimination can be constructed systematically. *} |
42908 | 254 |
|
255 |
||
256 |
section {* Recursive functions \label{sec:recursion} *} |
|
257 |
||
258 |
text {* |
|
259 |
\begin{matharray}{rcl} |
|
260 |
@{command_def (HOL) "primrec"} & : & @{text "local_theory \<rightarrow> local_theory"} \\ |
|
261 |
@{command_def (HOL) "fun"} & : & @{text "local_theory \<rightarrow> local_theory"} \\ |
|
262 |
@{command_def (HOL) "function"} & : & @{text "local_theory \<rightarrow> proof(prove)"} \\ |
|
263 |
@{command_def (HOL) "termination"} & : & @{text "local_theory \<rightarrow> proof(prove)"} \\ |
|
264 |
\end{matharray} |
|
265 |
||
266 |
@{rail " |
|
267 |
@@{command (HOL) primrec} @{syntax target}? @{syntax \"fixes\"} @'where' equations |
|
268 |
; |
|
269 |
(@@{command (HOL) fun} | @@{command (HOL) function}) @{syntax target}? functionopts? |
|
270 |
@{syntax \"fixes\"} \\ @'where' equations |
|
26849 | 271 |
; |
272 |
||
42908 | 273 |
equations: (@{syntax thmdecl}? @{syntax prop} + '|') |
26849 | 274 |
; |
42908 | 275 |
functionopts: '(' (('sequential' | 'domintros') + ',') ')' |
26849 | 276 |
; |
42908 | 277 |
@@{command (HOL) termination} @{syntax term}? |
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
278 |
"} |
26849 | 279 |
|
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
280 |
\begin{description} |
42123 | 281 |
|
42908 | 282 |
\item @{command (HOL) "primrec"} defines primitive recursive |
42912 | 283 |
functions over datatypes (see also @{command_ref (HOL) datatype} and |
284 |
@{command_ref (HOL) rep_datatype}). The given @{text equations} |
|
285 |
specify reduction rules that are produced by instantiating the |
|
286 |
generic combinator for primitive recursion that is available for |
|
287 |
each datatype. |
|
288 |
||
289 |
Each equation needs to be of the form: |
|
290 |
||
291 |
@{text [display] "f x\<^sub>1 \<dots> x\<^sub>m (C y\<^sub>1 \<dots> y\<^sub>k) z\<^sub>1 \<dots> z\<^sub>n = rhs"} |
|
292 |
||
293 |
such that @{text C} is a datatype constructor, @{text rhs} contains |
|
294 |
only the free variables on the left-hand side (or from the context), |
|
295 |
and all recursive occurrences of @{text "f"} in @{text "rhs"} are of |
|
296 |
the form @{text "f \<dots> y\<^sub>i \<dots>"} for some @{text i}. At most one |
|
297 |
reduction rule for each constructor can be given. The order does |
|
298 |
not matter. For missing constructors, the function is defined to |
|
299 |
return a default value, but this equation is made difficult to |
|
300 |
access for users. |
|
301 |
||
302 |
The reduction rules are declared as @{attribute simp} by default, |
|
303 |
which enables standard proof methods like @{method simp} and |
|
304 |
@{method auto} to normalize expressions of @{text "f"} applied to |
|
305 |
datatype constructions, by simulating symbolic computation via |
|
306 |
rewriting. |
|
35744 | 307 |
|
42908 | 308 |
\item @{command (HOL) "function"} defines functions by general |
309 |
wellfounded recursion. A detailed description with examples can be |
|
310 |
found in \cite{isabelle-function}. The function is specified by a |
|
311 |
set of (possibly conditional) recursive equations with arbitrary |
|
312 |
pattern matching. The command generates proof obligations for the |
|
313 |
completeness and the compatibility of patterns. |
|
42907
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42705
diff
changeset
|
314 |
|
42908 | 315 |
The defined function is considered partial, and the resulting |
316 |
simplification rules (named @{text "f.psimps"}) and induction rule |
|
317 |
(named @{text "f.pinduct"}) are guarded by a generated domain |
|
318 |
predicate @{text "f_dom"}. The @{command (HOL) "termination"} |
|
319 |
command can then be used to establish that the function is total. |
|
42123 | 320 |
|
42908 | 321 |
\item @{command (HOL) "fun"} is a shorthand notation for ``@{command |
322 |
(HOL) "function"}~@{text "(sequential)"}, followed by automated |
|
323 |
proof attempts regarding pattern matching and termination. See |
|
324 |
\cite{isabelle-function} for further details. |
|
42123 | 325 |
|
42908 | 326 |
\item @{command (HOL) "termination"}~@{text f} commences a |
327 |
termination proof for the previously defined function @{text f}. If |
|
328 |
this is omitted, the command refers to the most recent function |
|
329 |
definition. After the proof is closed, the recursive equations and |
|
330 |
the induction principle is established. |
|
26849 | 331 |
|
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
332 |
\end{description} |
42907
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42705
diff
changeset
|
333 |
|
42908 | 334 |
Recursive definitions introduced by the @{command (HOL) "function"} |
42912 | 335 |
command accommodate reasoning by induction (cf.\ @{method induct}): |
336 |
rule @{text "f.induct"} refers to a specific induction rule, with |
|
337 |
parameters named according to the user-specified equations. Cases |
|
338 |
are numbered starting from 1. For @{command (HOL) "primrec"}, the |
|
339 |
induction principle coincides with structural recursion on the |
|
340 |
datatype where the recursion is carried out. |
|
42908 | 341 |
|
342 |
The equations provided by these packages may be referred later as |
|
343 |
theorem list @{text "f.simps"}, where @{text f} is the (collective) |
|
344 |
name of the functions defined. Individual equations may be named |
|
345 |
explicitly as well. |
|
346 |
||
347 |
The @{command (HOL) "function"} command accepts the following |
|
348 |
options. |
|
349 |
||
350 |
\begin{description} |
|
351 |
||
352 |
\item @{text sequential} enables a preprocessor which disambiguates |
|
353 |
overlapping patterns by making them mutually disjoint. Earlier |
|
354 |
equations take precedence over later ones. This allows to give the |
|
355 |
specification in a format very similar to functional programming. |
|
356 |
Note that the resulting simplification and induction rules |
|
357 |
correspond to the transformed specification, not the one given |
|
358 |
originally. This usually means that each equation given by the user |
|
359 |
may result in several theorems. Also note that this automatic |
|
360 |
transformation only works for ML-style datatype patterns. |
|
361 |
||
362 |
\item @{text domintros} enables the automated generation of |
|
363 |
introduction rules for the domain predicate. While mostly not |
|
364 |
needed, they can be helpful in some proofs about partial functions. |
|
365 |
||
366 |
\end{description} |
|
26849 | 367 |
*} |
368 |
||
42912 | 369 |
subsubsection {* Example: evaluation of expressions *} |
370 |
||
371 |
text {* Subsequently, we define mutual datatypes for arithmetic and |
|
372 |
boolean expressions, and use @{command primrec} for evaluation |
|
373 |
functions that follow the same recursive structure. *} |
|
374 |
||
375 |
datatype 'a aexp = |
|
376 |
IF "'a bexp" "'a aexp" "'a aexp" |
|
377 |
| Sum "'a aexp" "'a aexp" |
|
378 |
| Diff "'a aexp" "'a aexp" |
|
379 |
| Var 'a |
|
380 |
| Num nat |
|
381 |
and 'a bexp = |
|
382 |
Less "'a aexp" "'a aexp" |
|
383 |
| And "'a bexp" "'a bexp" |
|
384 |
| Neg "'a bexp" |
|
385 |
||
386 |
||
387 |
text {* \medskip Evaluation of arithmetic and boolean expressions *} |
|
388 |
||
389 |
primrec evala :: "('a \<Rightarrow> nat) \<Rightarrow> 'a aexp \<Rightarrow> nat" |
|
390 |
and evalb :: "('a \<Rightarrow> nat) \<Rightarrow> 'a bexp \<Rightarrow> bool" |
|
391 |
where |
|
392 |
"evala env (IF b a1 a2) = (if evalb env b then evala env a1 else evala env a2)" |
|
393 |
| "evala env (Sum a1 a2) = evala env a1 + evala env a2" |
|
394 |
| "evala env (Diff a1 a2) = evala env a1 - evala env a2" |
|
395 |
| "evala env (Var v) = env v" |
|
396 |
| "evala env (Num n) = n" |
|
397 |
| "evalb env (Less a1 a2) = (evala env a1 < evala env a2)" |
|
398 |
| "evalb env (And b1 b2) = (evalb env b1 \<and> evalb env b2)" |
|
399 |
| "evalb env (Neg b) = (\<not> evalb env b)" |
|
400 |
||
401 |
text {* Since the value of an expression depends on the value of its |
|
402 |
variables, the functions @{const evala} and @{const evalb} take an |
|
403 |
additional parameter, an \emph{environment} that maps variables to |
|
404 |
their values. |
|
405 |
||
406 |
\medskip Substitution on expressions can be defined similarly. The |
|
407 |
mapping @{text f} of type @{typ "'a \<Rightarrow> 'a aexp"} given as a |
|
408 |
parameter is lifted canonically on the types @{typ "'a aexp"} and |
|
409 |
@{typ "'a bexp"}, respectively. |
|
410 |
*} |
|
411 |
||
412 |
primrec substa :: "('a \<Rightarrow> 'b aexp) \<Rightarrow> 'a aexp \<Rightarrow> 'b aexp" |
|
413 |
and substb :: "('a \<Rightarrow> 'b aexp) \<Rightarrow> 'a bexp \<Rightarrow> 'b bexp" |
|
414 |
where |
|
415 |
"substa f (IF b a1 a2) = IF (substb f b) (substa f a1) (substa f a2)" |
|
416 |
| "substa f (Sum a1 a2) = Sum (substa f a1) (substa f a2)" |
|
417 |
| "substa f (Diff a1 a2) = Diff (substa f a1) (substa f a2)" |
|
418 |
| "substa f (Var v) = f v" |
|
419 |
| "substa f (Num n) = Num n" |
|
420 |
| "substb f (Less a1 a2) = Less (substa f a1) (substa f a2)" |
|
421 |
| "substb f (And b1 b2) = And (substb f b1) (substb f b2)" |
|
422 |
| "substb f (Neg b) = Neg (substb f b)" |
|
423 |
||
424 |
text {* In textbooks about semantics one often finds substitution |
|
425 |
theorems, which express the relationship between substitution and |
|
426 |
evaluation. For @{typ "'a aexp"} and @{typ "'a bexp"}, we can prove |
|
427 |
such a theorem by mutual induction, followed by simplification. |
|
428 |
*} |
|
429 |
||
430 |
lemma subst_one: |
|
431 |
"evala env (substa (Var (v := a')) a) = evala (env (v := evala env a')) a" |
|
432 |
"evalb env (substb (Var (v := a')) b) = evalb (env (v := evala env a')) b" |
|
433 |
by (induct a and b) simp_all |
|
434 |
||
435 |
lemma subst_all: |
|
436 |
"evala env (substa s a) = evala (\<lambda>x. evala env (s x)) a" |
|
437 |
"evalb env (substb s b) = evalb (\<lambda>x. evala env (s x)) b" |
|
438 |
by (induct a and b) simp_all |
|
439 |
||
440 |
||
441 |
subsubsection {* Example: a substitution function for terms *} |
|
442 |
||
443 |
text {* Functions on datatypes with nested recursion are also defined |
|
444 |
by mutual primitive recursion. *} |
|
445 |
||
446 |
datatype ('a, 'b) "term" = Var 'a | App 'b "('a, 'b) term list" |
|
447 |
||
448 |
text {* A substitution function on type @{typ "('a, 'b) term"} can be |
|
449 |
defined as follows, by working simultaneously on @{typ "('a, 'b) |
|
450 |
term list"}: *} |
|
451 |
||
452 |
primrec subst_term :: "('a \<Rightarrow> ('a, 'b) term) \<Rightarrow> ('a, 'b) term \<Rightarrow> ('a, 'b) term" and |
|
453 |
subst_term_list :: "('a \<Rightarrow> ('a, 'b) term) \<Rightarrow> ('a, 'b) term list \<Rightarrow> ('a, 'b) term list" |
|
454 |
where |
|
455 |
"subst_term f (Var a) = f a" |
|
456 |
| "subst_term f (App b ts) = App b (subst_term_list f ts)" |
|
457 |
| "subst_term_list f [] = []" |
|
458 |
| "subst_term_list f (t # ts) = subst_term f t # subst_term_list f ts" |
|
459 |
||
460 |
text {* The recursion scheme follows the structure of the unfolded |
|
461 |
definition of type @{typ "('a, 'b) term"}. To prove properties of this |
|
462 |
substitution function, mutual induction is needed: |
|
463 |
*} |
|
464 |
||
465 |
lemma "subst_term (subst_term f1 \<circ> f2) t = subst_term f1 (subst_term f2 t)" and |
|
466 |
"subst_term_list (subst_term f1 \<circ> f2) ts = subst_term_list f1 (subst_term_list f2 ts)" |
|
467 |
by (induct t and ts) simp_all |
|
468 |
||
469 |
||
470 |
subsubsection {* Example: a map function for infinitely branching trees *} |
|
471 |
||
472 |
text {* Defining functions on infinitely branching datatypes by |
|
473 |
primitive recursion is just as easy. |
|
474 |
*} |
|
475 |
||
476 |
datatype 'a tree = Atom 'a | Branch "nat \<Rightarrow> 'a tree" |
|
477 |
||
478 |
primrec map_tree :: "('a \<Rightarrow> 'b) \<Rightarrow> 'a tree \<Rightarrow> 'b tree" |
|
479 |
where |
|
480 |
"map_tree f (Atom a) = Atom (f a)" |
|
481 |
| "map_tree f (Branch ts) = Branch (\<lambda>x. map_tree f (ts x))" |
|
482 |
||
483 |
text {* Note that all occurrences of functions such as @{text ts} |
|
484 |
above must be applied to an argument. In particular, @{term |
|
485 |
"map_tree f \<circ> ts"} is not allowed here. *} |
|
486 |
||
487 |
text {* Here is a simple composition lemma for @{term map_tree}: *} |
|
488 |
||
489 |
lemma "map_tree g (map_tree f t) = map_tree (g \<circ> f) t" |
|
490 |
by (induct t) simp_all |
|
491 |
||
42907
dfd4ef8e73f6
updated and re-unified HOL typedef, with some live examples;
wenzelm
parents:
42705
diff
changeset
|
492 |
|
42908 | 493 |
subsection {* Proof methods related to recursive definitions *} |
26849 | 494 |
|
495 |
text {* |
|
496 |
\begin{matharray}{rcl} |
|
42908 | 497 |
@{method_def (HOL) pat_completeness} & : & @{text method} \\ |
498 |
@{method_def (HOL) relation} & : & @{text method} \\ |
|
499 |
@{method_def (HOL) lexicographic_order} & : & @{text method} \\ |
|
500 |
@{method_def (HOL) size_change} & : & @{text method} \\ |
|
45944
e586f6d136b7
added some basic documentation about method induction_schema extracted from old NEWS
bulwahn
parents:
45943
diff
changeset
|
501 |
@{method_def (HOL) induction_schema} & : & @{text method} \\ |
26849 | 502 |
\end{matharray} |
503 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
504 |
@{rail " |
42908 | 505 |
@@{method (HOL) relation} @{syntax term} |
506 |
; |
|
507 |
@@{method (HOL) lexicographic_order} (@{syntax clasimpmod} * ) |
|
508 |
; |
|
509 |
@@{method (HOL) size_change} ( orders (@{syntax clasimpmod} * ) ) |
|
510 |
; |
|
45944
e586f6d136b7
added some basic documentation about method induction_schema extracted from old NEWS
bulwahn
parents:
45943
diff
changeset
|
511 |
@@{method (HOL) induction_schema} |
e586f6d136b7
added some basic documentation about method induction_schema extracted from old NEWS
bulwahn
parents:
45943
diff
changeset
|
512 |
; |
42908 | 513 |
orders: ( 'max' | 'min' | 'ms' ) * |
514 |
"} |
|
515 |
||
516 |
\begin{description} |
|
517 |
||
518 |
\item @{method (HOL) pat_completeness} is a specialized method to |
|
519 |
solve goals regarding the completeness of pattern matching, as |
|
520 |
required by the @{command (HOL) "function"} package (cf.\ |
|
521 |
\cite{isabelle-function}). |
|
522 |
||
523 |
\item @{method (HOL) relation}~@{text R} introduces a termination |
|
524 |
proof using the relation @{text R}. The resulting proof state will |
|
525 |
contain goals expressing that @{text R} is wellfounded, and that the |
|
526 |
arguments of recursive calls decrease with respect to @{text R}. |
|
527 |
Usually, this method is used as the initial proof step of manual |
|
528 |
termination proofs. |
|
529 |
||
530 |
\item @{method (HOL) "lexicographic_order"} attempts a fully |
|
531 |
automated termination proof by searching for a lexicographic |
|
532 |
combination of size measures on the arguments of the function. The |
|
533 |
method accepts the same arguments as the @{method auto} method, |
|
42930 | 534 |
which it uses internally to prove local descents. The @{syntax |
535 |
clasimpmod} modifiers are accepted (as for @{method auto}). |
|
42908 | 536 |
|
537 |
In case of failure, extensive information is printed, which can help |
|
538 |
to analyse the situation (cf.\ \cite{isabelle-function}). |
|
539 |
||
540 |
\item @{method (HOL) "size_change"} also works on termination goals, |
|
541 |
using a variation of the size-change principle, together with a |
|
542 |
graph decomposition technique (see \cite{krauss_phd} for details). |
|
543 |
Three kinds of orders are used internally: @{text max}, @{text min}, |
|
544 |
and @{text ms} (multiset), which is only available when the theory |
|
545 |
@{text Multiset} is loaded. When no order kinds are given, they are |
|
546 |
tried in order. The search for a termination proof uses SAT solving |
|
547 |
internally. |
|
548 |
||
42930 | 549 |
For local descent proofs, the @{syntax clasimpmod} modifiers are |
550 |
accepted (as for @{method auto}). |
|
42908 | 551 |
|
45944
e586f6d136b7
added some basic documentation about method induction_schema extracted from old NEWS
bulwahn
parents:
45943
diff
changeset
|
552 |
\item @{method (HOL) induction_schema} derives user-specified |
46283 | 553 |
induction rules from well-founded induction and completeness of |
554 |
patterns. This factors out some operations that are done internally |
|
555 |
by the function package and makes them available separately. See |
|
556 |
@{file "~~/src/HOL/ex/Induction_Schema.thy"} for examples. |
|
45944
e586f6d136b7
added some basic documentation about method induction_schema extracted from old NEWS
bulwahn
parents:
45943
diff
changeset
|
557 |
|
42908 | 558 |
\end{description} |
559 |
*} |
|
560 |
||
561 |
||
562 |
subsection {* Functions with explicit partiality *} |
|
563 |
||
564 |
text {* |
|
565 |
\begin{matharray}{rcl} |
|
566 |
@{command_def (HOL) "partial_function"} & : & @{text "local_theory \<rightarrow> local_theory"} \\ |
|
567 |
@{attribute_def (HOL) "partial_function_mono"} & : & @{text attribute} \\ |
|
568 |
\end{matharray} |
|
569 |
||
570 |
@{rail " |
|
571 |
@@{command (HOL) partial_function} @{syntax target}? |
|
572 |
'(' @{syntax nameref} ')' @{syntax \"fixes\"} \\ |
|
573 |
@'where' @{syntax thmdecl}? @{syntax prop} |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
574 |
"} |
26849 | 575 |
|
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
576 |
\begin{description} |
42123 | 577 |
|
42908 | 578 |
\item @{command (HOL) "partial_function"}~@{text "(mode)"} defines |
579 |
recursive functions based on fixpoints in complete partial |
|
580 |
orders. No termination proof is required from the user or |
|
581 |
constructed internally. Instead, the possibility of non-termination |
|
582 |
is modelled explicitly in the result type, which contains an |
|
583 |
explicit bottom element. |
|
584 |
||
585 |
Pattern matching and mutual recursion are currently not supported. |
|
586 |
Thus, the specification consists of a single function described by a |
|
587 |
single recursive equation. |
|
588 |
||
589 |
There are no fixed syntactic restrictions on the body of the |
|
590 |
function, but the induced functional must be provably monotonic |
|
52895
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
591 |
wrt.\ the underlying order. The monotonicity proof is performed |
42908 | 592 |
internally, and the definition is rejected when it fails. The proof |
593 |
can be influenced by declaring hints using the |
|
594 |
@{attribute (HOL) partial_function_mono} attribute. |
|
595 |
||
596 |
The mandatory @{text mode} argument specifies the mode of operation |
|
597 |
of the command, which directly corresponds to a complete partial |
|
598 |
order on the result type. By default, the following modes are |
|
599 |
defined: |
|
26849 | 600 |
|
42908 | 601 |
\begin{description} |
46283 | 602 |
|
42908 | 603 |
\item @{text option} defines functions that map into the @{type |
604 |
option} type. Here, the value @{term None} is used to model a |
|
605 |
non-terminating computation. Monotonicity requires that if @{term |
|
46283 | 606 |
None} is returned by a recursive call, then the overall result must |
607 |
also be @{term None}. This is best achieved through the use of the |
|
608 |
monadic operator @{const "Option.bind"}. |
|
42908 | 609 |
|
610 |
\item @{text tailrec} defines functions with an arbitrary result |
|
611 |
type and uses the slightly degenerated partial order where @{term |
|
612 |
"undefined"} is the bottom element. Now, monotonicity requires that |
|
613 |
if @{term undefined} is returned by a recursive call, then the |
|
614 |
overall result must also be @{term undefined}. In practice, this is |
|
615 |
only satisfied when each recursive call is a tail call, whose result |
|
616 |
is directly returned. Thus, this mode of operation allows the |
|
617 |
definition of arbitrary tail-recursive functions. |
|
46283 | 618 |
|
42908 | 619 |
\end{description} |
620 |
||
621 |
Experienced users may define new modes by instantiating the locale |
|
622 |
@{const "partial_function_definitions"} appropriately. |
|
623 |
||
624 |
\item @{attribute (HOL) partial_function_mono} declares rules for |
|
52895
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
625 |
use in the internal monotonicity proofs of partial function |
42908 | 626 |
definitions. |
26849 | 627 |
|
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
628 |
\end{description} |
42908 | 629 |
|
630 |
*} |
|
631 |
||
632 |
||
633 |
subsection {* Old-style recursive function definitions (TFL) *} |
|
634 |
||
635 |
text {* |
|
636 |
\begin{matharray}{rcl} |
|
637 |
@{command_def (HOL) "recdef"} & : & @{text "theory \<rightarrow> theory)"} \\ |
|
638 |
@{command_def (HOL) "recdef_tc"}@{text "\<^sup>*"} & : & @{text "theory \<rightarrow> proof(prove)"} \\ |
|
639 |
\end{matharray} |
|
640 |
||
46280 | 641 |
The old TFL commands @{command (HOL) "recdef"} and @{command (HOL) |
642 |
"recdef_tc"} for defining recursive are mostly obsolete; @{command |
|
643 |
(HOL) "function"} or @{command (HOL) "fun"} should be used instead. |
|
644 |
||
42908 | 645 |
@{rail " |
646 |
@@{command (HOL) recdef} ('(' @'permissive' ')')? \\ |
|
647 |
@{syntax name} @{syntax term} (@{syntax prop} +) hints? |
|
648 |
; |
|
649 |
recdeftc @{syntax thmdecl}? tc |
|
650 |
; |
|
651 |
hints: '(' @'hints' ( recdefmod * ) ')' |
|
652 |
; |
|
653 |
recdefmod: (('recdef_simp' | 'recdef_cong' | 'recdef_wf') |
|
654 |
(() | 'add' | 'del') ':' @{syntax thmrefs}) | @{syntax clasimpmod} |
|
655 |
; |
|
656 |
tc: @{syntax nameref} ('(' @{syntax nat} ')')? |
|
657 |
"} |
|
658 |
||
659 |
\begin{description} |
|
660 |
||
661 |
\item @{command (HOL) "recdef"} defines general well-founded |
|
662 |
recursive functions (using the TFL package), see also |
|
663 |
\cite{isabelle-HOL}. The ``@{text "(permissive)"}'' option tells |
|
664 |
TFL to recover from failed proof attempts, returning unfinished |
|
665 |
results. The @{text recdef_simp}, @{text recdef_cong}, and @{text |
|
666 |
recdef_wf} hints refer to auxiliary rules to be used in the internal |
|
667 |
automated proof process of TFL. Additional @{syntax clasimpmod} |
|
42930 | 668 |
declarations may be given to tune the context of the Simplifier |
669 |
(cf.\ \secref{sec:simplifier}) and Classical reasoner (cf.\ |
|
670 |
\secref{sec:classical}). |
|
42908 | 671 |
|
672 |
\item @{command (HOL) "recdef_tc"}~@{text "c (i)"} recommences the |
|
673 |
proof for leftover termination condition number @{text i} (default |
|
674 |
1) as generated by a @{command (HOL) "recdef"} definition of |
|
675 |
constant @{text c}. |
|
676 |
||
677 |
Note that in most cases, @{command (HOL) "recdef"} is able to finish |
|
678 |
its internal proofs without manual intervention. |
|
679 |
||
680 |
\end{description} |
|
681 |
||
682 |
\medskip Hints for @{command (HOL) "recdef"} may be also declared |
|
683 |
globally, using the following attributes. |
|
684 |
||
685 |
\begin{matharray}{rcl} |
|
686 |
@{attribute_def (HOL) recdef_simp} & : & @{text attribute} \\ |
|
687 |
@{attribute_def (HOL) recdef_cong} & : & @{text attribute} \\ |
|
688 |
@{attribute_def (HOL) recdef_wf} & : & @{text attribute} \\ |
|
689 |
\end{matharray} |
|
690 |
||
691 |
@{rail " |
|
692 |
(@@{attribute (HOL) recdef_simp} | @@{attribute (HOL) recdef_cong} | |
|
693 |
@@{attribute (HOL) recdef_wf}) (() | 'add' | 'del') |
|
694 |
"} |
|
695 |
*} |
|
696 |
||
697 |
||
698 |
section {* Datatypes \label{sec:hol-datatype} *} |
|
699 |
||
700 |
text {* |
|
701 |
\begin{matharray}{rcl} |
|
702 |
@{command_def (HOL) "datatype"} & : & @{text "theory \<rightarrow> theory"} \\ |
|
703 |
@{command_def (HOL) "rep_datatype"} & : & @{text "theory \<rightarrow> proof(prove)"} \\ |
|
704 |
\end{matharray} |
|
705 |
||
706 |
@{rail " |
|
707 |
@@{command (HOL) datatype} (spec + @'and') |
|
708 |
; |
|
709 |
@@{command (HOL) rep_datatype} ('(' (@{syntax name} +) ')')? (@{syntax term} +) |
|
710 |
; |
|
711 |
||
45839
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45768
diff
changeset
|
712 |
spec: @{syntax typespec_sorts} @{syntax mixfix}? '=' (cons + '|') |
42908 | 713 |
; |
714 |
cons: @{syntax name} (@{syntax type} * ) @{syntax mixfix}? |
|
715 |
"} |
|
716 |
||
717 |
\begin{description} |
|
718 |
||
719 |
\item @{command (HOL) "datatype"} defines inductive datatypes in |
|
720 |
HOL. |
|
721 |
||
722 |
\item @{command (HOL) "rep_datatype"} represents existing types as |
|
42909 | 723 |
datatypes. |
724 |
||
725 |
For foundational reasons, some basic types such as @{typ nat}, @{typ |
|
726 |
"'a \<times> 'b"}, @{typ "'a + 'b"}, @{typ bool} and @{typ unit} are |
|
727 |
introduced by more primitive means using @{command_ref typedef}. To |
|
728 |
recover the rich infrastructure of @{command datatype} (e.g.\ rules |
|
729 |
for @{method cases} and @{method induct} and the primitive recursion |
|
730 |
combinators), such types may be represented as actual datatypes |
|
731 |
later. This is done by specifying the constructors of the desired |
|
732 |
type, and giving a proof of the induction rule, distinctness and |
|
733 |
injectivity of constructors. |
|
734 |
||
735 |
For example, see @{file "~~/src/HOL/Sum_Type.thy"} for the |
|
736 |
representation of the primitive sum type as fully-featured datatype. |
|
42908 | 737 |
|
738 |
\end{description} |
|
739 |
||
42909 | 740 |
The generated rules for @{method induct} and @{method cases} provide |
741 |
case names according to the given constructors, while parameters are |
|
742 |
named after the types (see also \secref{sec:cases-induct}). |
|
42908 | 743 |
|
744 |
See \cite{isabelle-HOL} for more details on datatypes, but beware of |
|
745 |
the old-style theory syntax being used there! Apart from proper |
|
746 |
proof methods for case-analysis and induction, there are also |
|
747 |
emulations of ML tactics @{method (HOL) case_tac} and @{method (HOL) |
|
748 |
induct_tac} available, see \secref{sec:hol-induct-tac}; these admit |
|
749 |
to refer directly to the internal structure of subgoals (including |
|
750 |
internally bound parameters). |
|
26849 | 751 |
*} |
752 |
||
753 |
||
42910
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
754 |
subsubsection {* Examples *} |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
755 |
|
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
756 |
text {* We define a type of finite sequences, with slightly different |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
757 |
names than the existing @{typ "'a list"} that is already in @{theory |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
758 |
Main}: *} |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
759 |
|
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
760 |
datatype 'a seq = Empty | Seq 'a "'a seq" |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
761 |
|
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
762 |
text {* We can now prove some simple lemma by structural induction: *} |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
763 |
|
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
764 |
lemma "Seq x xs \<noteq> xs" |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
765 |
proof (induct xs arbitrary: x) |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
766 |
case Empty |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
767 |
txt {* This case can be proved using the simplifier: the freeness |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
768 |
properties of the datatype are already declared as @{attribute |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
769 |
simp} rules. *} |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
770 |
show "Seq x Empty \<noteq> Empty" |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
771 |
by simp |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
772 |
next |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
773 |
case (Seq y ys) |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
774 |
txt {* The step case is proved similarly. *} |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
775 |
show "Seq x (Seq y ys) \<noteq> Seq y ys" |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
776 |
using `Seq y ys \<noteq> ys` by simp |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
777 |
qed |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
778 |
|
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
779 |
text {* Here is a more succinct version of the same proof: *} |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
780 |
|
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
781 |
lemma "Seq x xs \<noteq> xs" |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
782 |
by (induct xs arbitrary: x) simp_all |
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
783 |
|
6834af822a8b
updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);
wenzelm
parents:
42909
diff
changeset
|
784 |
|
26849 | 785 |
section {* Records \label{sec:hol-record} *} |
786 |
||
787 |
text {* |
|
788 |
In principle, records merely generalize the concept of tuples, where |
|
789 |
components may be addressed by labels instead of just position. The |
|
790 |
logical infrastructure of records in Isabelle/HOL is slightly more |
|
791 |
advanced, though, supporting truly extensible record schemes. This |
|
792 |
admits operations that are polymorphic with respect to record |
|
793 |
extension, yielding ``object-oriented'' effects like (single) |
|
794 |
inheritance. See also \cite{NaraschewskiW-TPHOLs98} for more |
|
795 |
details on object-oriented verification and record subtyping in HOL. |
|
796 |
*} |
|
797 |
||
798 |
||
799 |
subsection {* Basic concepts *} |
|
800 |
||
801 |
text {* |
|
802 |
Isabelle/HOL supports both \emph{fixed} and \emph{schematic} records |
|
803 |
at the level of terms and types. The notation is as follows: |
|
804 |
||
805 |
\begin{center} |
|
806 |
\begin{tabular}{l|l|l} |
|
807 |
& record terms & record types \\ \hline |
|
808 |
fixed & @{text "\<lparr>x = a, y = b\<rparr>"} & @{text "\<lparr>x :: A, y :: B\<rparr>"} \\ |
|
809 |
schematic & @{text "\<lparr>x = a, y = b, \<dots> = m\<rparr>"} & |
|
810 |
@{text "\<lparr>x :: A, y :: B, \<dots> :: M\<rparr>"} \\ |
|
811 |
\end{tabular} |
|
812 |
\end{center} |
|
813 |
||
814 |
\noindent The ASCII representation of @{text "\<lparr>x = a\<rparr>"} is @{text |
|
815 |
"(| x = a |)"}. |
|
816 |
||
817 |
A fixed record @{text "\<lparr>x = a, y = b\<rparr>"} has field @{text x} of value |
|
818 |
@{text a} and field @{text y} of value @{text b}. The corresponding |
|
819 |
type is @{text "\<lparr>x :: A, y :: B\<rparr>"}, assuming that @{text "a :: A"} |
|
820 |
and @{text "b :: B"}. |
|
821 |
||
822 |
A record scheme like @{text "\<lparr>x = a, y = b, \<dots> = m\<rparr>"} contains fields |
|
823 |
@{text x} and @{text y} as before, but also possibly further fields |
|
824 |
as indicated by the ``@{text "\<dots>"}'' notation (which is actually part |
|
825 |
of the syntax). The improper field ``@{text "\<dots>"}'' of a record |
|
826 |
scheme is called the \emph{more part}. Logically it is just a free |
|
827 |
variable, which is occasionally referred to as ``row variable'' in |
|
828 |
the literature. The more part of a record scheme may be |
|
829 |
instantiated by zero or more further components. For example, the |
|
830 |
previous scheme may get instantiated to @{text "\<lparr>x = a, y = b, z = |
|
26852 | 831 |
c, \<dots> = m'\<rparr>"}, where @{text m'} refers to a different more part. |
26849 | 832 |
Fixed records are special instances of record schemes, where |
833 |
``@{text "\<dots>"}'' is properly terminated by the @{text "() :: unit"} |
|
834 |
element. In fact, @{text "\<lparr>x = a, y = b\<rparr>"} is just an abbreviation |
|
835 |
for @{text "\<lparr>x = a, y = b, \<dots> = ()\<rparr>"}. |
|
42123 | 836 |
|
26849 | 837 |
\medskip Two key observations make extensible records in a simply |
838 |
typed language like HOL work out: |
|
839 |
||
840 |
\begin{enumerate} |
|
841 |
||
842 |
\item the more part is internalized, as a free term or type |
|
843 |
variable, |
|
844 |
||
26852 | 845 |
\item field names are externalized, they cannot be accessed within |
846 |
the logic as first-class values. |
|
26849 | 847 |
|
848 |
\end{enumerate} |
|
849 |
||
850 |
\medskip In Isabelle/HOL record types have to be defined explicitly, |
|
851 |
fixing their field names and types, and their (optional) parent |
|
852 |
record. Afterwards, records may be formed using above syntax, while |
|
853 |
obeying the canonical order of fields as given by their declaration. |
|
854 |
The record package provides several standard operations like |
|
855 |
selectors and updates. The common setup for various generic proof |
|
856 |
tools enable succinct reasoning patterns. See also the Isabelle/HOL |
|
857 |
tutorial \cite{isabelle-hol-book} for further instructions on using |
|
858 |
records in practice. |
|
859 |
*} |
|
860 |
||
861 |
||
862 |
subsection {* Record specifications *} |
|
863 |
||
864 |
text {* |
|
865 |
\begin{matharray}{rcl} |
|
28761
9ec4482c9201
updated/refined types of Isar language elements, removed special LaTeX macros;
wenzelm
parents:
28760
diff
changeset
|
866 |
@{command_def (HOL) "record"} & : & @{text "theory \<rightarrow> theory"} \\ |
26849 | 867 |
\end{matharray} |
868 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
869 |
@{rail " |
42705 | 870 |
@@{command (HOL) record} @{syntax typespec_sorts} '=' \\ |
46494
ea2ae63336f3
clarified outer syntax "constdecl", which is only local to some rail diagrams;
wenzelm
parents:
46457
diff
changeset
|
871 |
(@{syntax type} '+')? (constdecl +) |
ea2ae63336f3
clarified outer syntax "constdecl", which is only local to some rail diagrams;
wenzelm
parents:
46457
diff
changeset
|
872 |
; |
ea2ae63336f3
clarified outer syntax "constdecl", which is only local to some rail diagrams;
wenzelm
parents:
46457
diff
changeset
|
873 |
constdecl: @{syntax name} '::' @{syntax type} @{syntax mixfix}? |
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
874 |
"} |
26849 | 875 |
|
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
876 |
\begin{description} |
26849 | 877 |
|
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
878 |
\item @{command (HOL) "record"}~@{text "(\<alpha>\<^sub>1, \<dots>, \<alpha>\<^sub>m) t = \<tau> + c\<^sub>1 :: \<sigma>\<^sub>1 |
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
879 |
\<dots> c\<^sub>n :: \<sigma>\<^sub>n"} defines extensible record type @{text "(\<alpha>\<^sub>1, \<dots>, \<alpha>\<^sub>m) t"}, |
26849 | 880 |
derived from the optional parent record @{text "\<tau>"} by adding new |
881 |
field components @{text "c\<^sub>i :: \<sigma>\<^sub>i"} etc. |
|
882 |
||
883 |
The type variables of @{text "\<tau>"} and @{text "\<sigma>\<^sub>i"} need to be |
|
884 |
covered by the (distinct) parameters @{text "\<alpha>\<^sub>1, \<dots>, |
|
885 |
\<alpha>\<^sub>m"}. Type constructor @{text t} has to be new, while @{text |
|
886 |
\<tau>} needs to specify an instance of an existing record type. At |
|
887 |
least one new field @{text "c\<^sub>i"} has to be specified. |
|
888 |
Basically, field names need to belong to a unique record. This is |
|
889 |
not a real restriction in practice, since fields are qualified by |
|
890 |
the record name internally. |
|
891 |
||
892 |
The parent record specification @{text \<tau>} is optional; if omitted |
|
893 |
@{text t} becomes a root record. The hierarchy of all records |
|
894 |
declared within a theory context forms a forest structure, i.e.\ a |
|
895 |
set of trees starting with a root record each. There is no way to |
|
896 |
merge multiple parent records! |
|
897 |
||
898 |
For convenience, @{text "(\<alpha>\<^sub>1, \<dots>, \<alpha>\<^sub>m) t"} is made a |
|
899 |
type abbreviation for the fixed record type @{text "\<lparr>c\<^sub>1 :: |
|
900 |
\<sigma>\<^sub>1, \<dots>, c\<^sub>n :: \<sigma>\<^sub>n\<rparr>"}, likewise is @{text |
|
901 |
"(\<alpha>\<^sub>1, \<dots>, \<alpha>\<^sub>m, \<zeta>) t_scheme"} made an abbreviation for |
|
902 |
@{text "\<lparr>c\<^sub>1 :: \<sigma>\<^sub>1, \<dots>, c\<^sub>n :: \<sigma>\<^sub>n, \<dots> :: |
|
903 |
\<zeta>\<rparr>"}. |
|
904 |
||
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
905 |
\end{description} |
26849 | 906 |
*} |
907 |
||
908 |
||
909 |
subsection {* Record operations *} |
|
910 |
||
911 |
text {* |
|
912 |
Any record definition of the form presented above produces certain |
|
913 |
standard operations. Selectors and updates are provided for any |
|
914 |
field, including the improper one ``@{text more}''. There are also |
|
915 |
cumulative record constructor functions. To simplify the |
|
916 |
presentation below, we assume for now that @{text "(\<alpha>\<^sub>1, \<dots>, |
|
917 |
\<alpha>\<^sub>m) t"} is a root record with fields @{text "c\<^sub>1 :: |
|
918 |
\<sigma>\<^sub>1, \<dots>, c\<^sub>n :: \<sigma>\<^sub>n"}. |
|
919 |
||
920 |
\medskip \textbf{Selectors} and \textbf{updates} are available for |
|
921 |
any field (including ``@{text more}''): |
|
922 |
||
923 |
\begin{matharray}{lll} |
|
26852 | 924 |
@{text "c\<^sub>i"} & @{text "::"} & @{text "\<lparr>\<^vec>c :: \<^vec>\<sigma>, \<dots> :: \<zeta>\<rparr> \<Rightarrow> \<sigma>\<^sub>i"} \\ |
925 |
@{text "c\<^sub>i_update"} & @{text "::"} & @{text "\<sigma>\<^sub>i \<Rightarrow> \<lparr>\<^vec>c :: \<^vec>\<sigma>, \<dots> :: \<zeta>\<rparr> \<Rightarrow> \<lparr>\<^vec>c :: \<^vec>\<sigma>, \<dots> :: \<zeta>\<rparr>"} \\ |
|
26849 | 926 |
\end{matharray} |
927 |
||
928 |
There is special syntax for application of updates: @{text "r\<lparr>x := |
|
929 |
a\<rparr>"} abbreviates term @{text "x_update a r"}. Further notation for |
|
930 |
repeated updates is also available: @{text "r\<lparr>x := a\<rparr>\<lparr>y := b\<rparr>\<lparr>z := |
|
931 |
c\<rparr>"} may be written @{text "r\<lparr>x := a, y := b, z := c\<rparr>"}. Note that |
|
932 |
because of postfix notation the order of fields shown here is |
|
933 |
reverse than in the actual term. Since repeated updates are just |
|
934 |
function applications, fields may be freely permuted in @{text "\<lparr>x |
|
935 |
:= a, y := b, z := c\<rparr>"}, as far as logical equality is concerned. |
|
936 |
Thus commutativity of independent updates can be proven within the |
|
937 |
logic for any two fields, but not as a general theorem. |
|
938 |
||
939 |
\medskip The \textbf{make} operation provides a cumulative record |
|
940 |
constructor function: |
|
941 |
||
942 |
\begin{matharray}{lll} |
|
26852 | 943 |
@{text "t.make"} & @{text "::"} & @{text "\<sigma>\<^sub>1 \<Rightarrow> \<dots> \<sigma>\<^sub>n \<Rightarrow> \<lparr>\<^vec>c :: \<^vec>\<sigma>\<rparr>"} \\ |
26849 | 944 |
\end{matharray} |
945 |
||
946 |
\medskip We now reconsider the case of non-root records, which are |
|
947 |
derived of some parent. In general, the latter may depend on |
|
948 |
another parent as well, resulting in a list of \emph{ancestor |
|
949 |
records}. Appending the lists of fields of all ancestors results in |
|
950 |
a certain field prefix. The record package automatically takes care |
|
951 |
of this by lifting operations over this context of ancestor fields. |
|
952 |
Assuming that @{text "(\<alpha>\<^sub>1, \<dots>, \<alpha>\<^sub>m) t"} has ancestor |
|
953 |
fields @{text "b\<^sub>1 :: \<rho>\<^sub>1, \<dots>, b\<^sub>k :: \<rho>\<^sub>k"}, |
|
954 |
the above record operations will get the following types: |
|
955 |
||
26852 | 956 |
\medskip |
957 |
\begin{tabular}{lll} |
|
958 |
@{text "c\<^sub>i"} & @{text "::"} & @{text "\<lparr>\<^vec>b :: \<^vec>\<rho>, \<^vec>c :: \<^vec>\<sigma>, \<dots> :: \<zeta>\<rparr> \<Rightarrow> \<sigma>\<^sub>i"} \\ |
|
42123 | 959 |
@{text "c\<^sub>i_update"} & @{text "::"} & @{text "\<sigma>\<^sub>i \<Rightarrow> |
26852 | 960 |
\<lparr>\<^vec>b :: \<^vec>\<rho>, \<^vec>c :: \<^vec>\<sigma>, \<dots> :: \<zeta>\<rparr> \<Rightarrow> |
961 |
\<lparr>\<^vec>b :: \<^vec>\<rho>, \<^vec>c :: \<^vec>\<sigma>, \<dots> :: \<zeta>\<rparr>"} \\ |
|
962 |
@{text "t.make"} & @{text "::"} & @{text "\<rho>\<^sub>1 \<Rightarrow> \<dots> \<rho>\<^sub>k \<Rightarrow> \<sigma>\<^sub>1 \<Rightarrow> \<dots> \<sigma>\<^sub>n \<Rightarrow> |
|
963 |
\<lparr>\<^vec>b :: \<^vec>\<rho>, \<^vec>c :: \<^vec>\<sigma>\<rparr>"} \\ |
|
964 |
\end{tabular} |
|
965 |
\medskip |
|
26849 | 966 |
|
26852 | 967 |
\noindent Some further operations address the extension aspect of a |
26849 | 968 |
derived record scheme specifically: @{text "t.fields"} produces a |
969 |
record fragment consisting of exactly the new fields introduced here |
|
970 |
(the result may serve as a more part elsewhere); @{text "t.extend"} |
|
971 |
takes a fixed record and adds a given more part; @{text |
|
972 |
"t.truncate"} restricts a record scheme to a fixed record. |
|
973 |
||
26852 | 974 |
\medskip |
975 |
\begin{tabular}{lll} |
|
976 |
@{text "t.fields"} & @{text "::"} & @{text "\<sigma>\<^sub>1 \<Rightarrow> \<dots> \<sigma>\<^sub>n \<Rightarrow> \<lparr>\<^vec>c :: \<^vec>\<sigma>\<rparr>"} \\ |
|
977 |
@{text "t.extend"} & @{text "::"} & @{text "\<lparr>\<^vec>b :: \<^vec>\<rho>, \<^vec>c :: \<^vec>\<sigma>\<rparr> \<Rightarrow> |
|
978 |
\<zeta> \<Rightarrow> \<lparr>\<^vec>b :: \<^vec>\<rho>, \<^vec>c :: \<^vec>\<sigma>, \<dots> :: \<zeta>\<rparr>"} \\ |
|
979 |
@{text "t.truncate"} & @{text "::"} & @{text "\<lparr>\<^vec>b :: \<^vec>\<rho>, \<^vec>c :: \<^vec>\<sigma>, \<dots> :: \<zeta>\<rparr> \<Rightarrow> \<lparr>\<^vec>b :: \<^vec>\<rho>, \<^vec>c :: \<^vec>\<sigma>\<rparr>"} \\ |
|
980 |
\end{tabular} |
|
981 |
\medskip |
|
26849 | 982 |
|
983 |
\noindent Note that @{text "t.make"} and @{text "t.fields"} coincide |
|
984 |
for root records. |
|
985 |
*} |
|
986 |
||
987 |
||
988 |
subsection {* Derived rules and proof tools *} |
|
989 |
||
990 |
text {* |
|
991 |
The record package proves several results internally, declaring |
|
992 |
these facts to appropriate proof tools. This enables users to |
|
993 |
reason about record structures quite conveniently. Assume that |
|
994 |
@{text t} is a record type as specified above. |
|
995 |
||
996 |
\begin{enumerate} |
|
42123 | 997 |
|
26849 | 998 |
\item Standard conversions for selectors or updates applied to |
999 |
record constructor terms are made part of the default Simplifier |
|
1000 |
context; thus proofs by reduction of basic operations merely require |
|
1001 |
the @{method simp} method without further arguments. These rules |
|
1002 |
are available as @{text "t.simps"}, too. |
|
42123 | 1003 |
|
26849 | 1004 |
\item Selectors applied to updated records are automatically reduced |
1005 |
by an internal simplification procedure, which is also part of the |
|
1006 |
standard Simplifier setup. |
|
1007 |
||
1008 |
\item Inject equations of a form analogous to @{prop "(x, y) = (x', |
|
1009 |
y') \<equiv> x = x' \<and> y = y'"} are declared to the Simplifier and Classical |
|
1010 |
Reasoner as @{attribute iff} rules. These rules are available as |
|
1011 |
@{text "t.iffs"}. |
|
1012 |
||
1013 |
\item The introduction rule for record equality analogous to @{text |
|
1014 |
"x r = x r' \<Longrightarrow> y r = y r' \<dots> \<Longrightarrow> r = r'"} is declared to the Simplifier, |
|
1015 |
and as the basic rule context as ``@{attribute intro}@{text "?"}''. |
|
1016 |
The rule is called @{text "t.equality"}. |
|
1017 |
||
1018 |
\item Representations of arbitrary record expressions as canonical |
|
1019 |
constructor terms are provided both in @{method cases} and @{method |
|
1020 |
induct} format (cf.\ the generic proof methods of the same name, |
|
1021 |
\secref{sec:cases-induct}). Several variations are available, for |
|
1022 |
fixed records, record schemes, more parts etc. |
|
42123 | 1023 |
|
26849 | 1024 |
The generic proof methods are sufficiently smart to pick the most |
1025 |
sensible rule according to the type of the indicated record |
|
1026 |
expression: users just need to apply something like ``@{text "(cases |
|
1027 |
r)"}'' to a certain proof problem. |
|
1028 |
||
1029 |
\item The derived record operations @{text "t.make"}, @{text |
|
1030 |
"t.fields"}, @{text "t.extend"}, @{text "t.truncate"} are \emph{not} |
|
1031 |
treated automatically, but usually need to be expanded by hand, |
|
1032 |
using the collective fact @{text "t.defs"}. |
|
1033 |
||
1034 |
\end{enumerate} |
|
1035 |
*} |
|
1036 |
||
1037 |
||
42911 | 1038 |
subsubsection {* Examples *} |
1039 |
||
1040 |
text {* See @{file "~~/src/HOL/ex/Records.thy"}, for example. *} |
|
1041 |
||
42908 | 1042 |
section {* Typedef axiomatization \label{sec:hol-typedef} *} |
1043 |
||
46280 | 1044 |
text {* |
1045 |
\begin{matharray}{rcl} |
|
1046 |
@{command_def (HOL) "typedef"} & : & @{text "local_theory \<rightarrow> proof(prove)"} \\ |
|
1047 |
\end{matharray} |
|
1048 |
||
1049 |
A Gordon/HOL-style type definition is a certain axiom scheme that |
|
1050 |
identifies a new type with a subset of an existing type. More |
|
42908 | 1051 |
precisely, the new type is defined by exhibiting an existing type |
1052 |
@{text \<tau>}, a set @{text "A :: \<tau> set"}, and a theorem that proves |
|
1053 |
@{prop "\<exists>x. x \<in> A"}. Thus @{text A} is a non-empty subset of @{text |
|
1054 |
\<tau>}, and the new type denotes this subset. New functions are |
|
1055 |
postulated that establish an isomorphism between the new type and |
|
1056 |
the subset. In general, the type @{text \<tau>} may involve type |
|
1057 |
variables @{text "\<alpha>\<^sub>1, \<dots>, \<alpha>\<^sub>n"} which means that the type definition |
|
1058 |
produces a type constructor @{text "(\<alpha>\<^sub>1, \<dots>, \<alpha>\<^sub>n) t"} depending on |
|
1059 |
those type arguments. |
|
1060 |
||
1061 |
The axiomatization can be considered a ``definition'' in the sense |
|
1062 |
of the particular set-theoretic interpretation of HOL |
|
1063 |
\cite{pitts93}, where the universe of types is required to be |
|
1064 |
downwards-closed wrt.\ arbitrary non-empty subsets. Thus genuinely |
|
1065 |
new types introduced by @{command "typedef"} stay within the range |
|
1066 |
of HOL models by construction. Note that @{command_ref |
|
1067 |
type_synonym} from Isabelle/Pure merely introduces syntactic |
|
1068 |
abbreviations, without any logical significance. |
|
47859 | 1069 |
|
42908 | 1070 |
@{rail " |
49836
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49834
diff
changeset
|
1071 |
@@{command (HOL) typedef} abs_type '=' rep_set |
26849 | 1072 |
; |
1073 |
||
42908 | 1074 |
abs_type: @{syntax typespec_sorts} @{syntax mixfix}? |
1075 |
; |
|
1076 |
rep_set: @{syntax term} (@'morphisms' @{syntax name} @{syntax name})? |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1077 |
"} |
26849 | 1078 |
|
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
1079 |
\begin{description} |
26849 | 1080 |
|
42908 | 1081 |
\item @{command (HOL) "typedef"}~@{text "(\<alpha>\<^sub>1, \<dots>, \<alpha>\<^sub>n) t = A"} |
1082 |
axiomatizes a type definition in the background theory of the |
|
1083 |
current context, depending on a non-emptiness result of the set |
|
1084 |
@{text A} that needs to be proven here. The set @{text A} may |
|
1085 |
contain type variables @{text "\<alpha>\<^sub>1, \<dots>, \<alpha>\<^sub>n"} as specified on the LHS, |
|
1086 |
but no term variables. |
|
1087 |
||
1088 |
Even though a local theory specification, the newly introduced type |
|
1089 |
constructor cannot depend on parameters or assumptions of the |
|
1090 |
context: this is structurally impossible in HOL. In contrast, the |
|
1091 |
non-emptiness proof may use local assumptions in unusual situations, |
|
1092 |
which could result in different interpretations in target contexts: |
|
1093 |
the meaning of the bijection between the representing set @{text A} |
|
1094 |
and the new type @{text t} may then change in different application |
|
1095 |
contexts. |
|
1096 |
||
49836
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49834
diff
changeset
|
1097 |
For @{command (HOL) "typedef"}~@{text "t = A"} the newly introduced |
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49834
diff
changeset
|
1098 |
type @{text t} is accompanied by a pair of morphisms to relate it to |
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49834
diff
changeset
|
1099 |
the representing set over the old type. By default, the injection |
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49834
diff
changeset
|
1100 |
from type to set is called @{text Rep_t} and its inverse @{text |
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49834
diff
changeset
|
1101 |
Abs_t}: An explicit @{keyword (HOL) "morphisms"} specification |
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49834
diff
changeset
|
1102 |
allows to provide alternative names. |
26849 | 1103 |
|
42908 | 1104 |
The core axiomatization uses the locale predicate @{const |
1105 |
type_definition} as defined in Isabelle/HOL. Various basic |
|
1106 |
consequences of that are instantiated accordingly, re-using the |
|
1107 |
locale facts with names derived from the new type constructor. Thus |
|
1108 |
the generic @{thm type_definition.Rep} is turned into the specific |
|
1109 |
@{text "Rep_t"}, for example. |
|
1110 |
||
1111 |
Theorems @{thm type_definition.Rep}, @{thm |
|
1112 |
type_definition.Rep_inverse}, and @{thm type_definition.Abs_inverse} |
|
1113 |
provide the most basic characterization as a corresponding |
|
1114 |
injection/surjection pair (in both directions). The derived rules |
|
1115 |
@{thm type_definition.Rep_inject} and @{thm |
|
1116 |
type_definition.Abs_inject} provide a more convenient version of |
|
1117 |
injectivity, suitable for automated proof tools (e.g.\ in |
|
1118 |
declarations involving @{attribute simp} or @{attribute iff}). |
|
1119 |
Furthermore, the rules @{thm type_definition.Rep_cases}~/ @{thm |
|
1120 |
type_definition.Rep_induct}, and @{thm type_definition.Abs_cases}~/ |
|
1121 |
@{thm type_definition.Abs_induct} provide alternative views on |
|
1122 |
surjectivity. These rules are already declared as set or type rules |
|
1123 |
for the generic @{method cases} and @{method induct} methods, |
|
1124 |
respectively. |
|
1125 |
||
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
1126 |
\end{description} |
26849 | 1127 |
|
42908 | 1128 |
\begin{warn} |
1129 |
If you introduce a new type axiomatically, i.e.\ via @{command_ref |
|
1130 |
typedecl} and @{command_ref axiomatization}, the minimum requirement |
|
1131 |
is that it has a non-empty model, to avoid immediate collapse of the |
|
1132 |
HOL logic. Moreover, one needs to demonstrate that the |
|
1133 |
interpretation of such free-form axiomatizations can coexist with |
|
1134 |
that of the regular @{command_def typedef} scheme, and any extension |
|
49836
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49834
diff
changeset
|
1135 |
that other people might have introduced elsewhere. |
42908 | 1136 |
\end{warn} |
1137 |
*} |
|
1138 |
||
1139 |
subsubsection {* Examples *} |
|
1140 |
||
1141 |
text {* Type definitions permit the introduction of abstract data |
|
1142 |
types in a safe way, namely by providing models based on already |
|
1143 |
existing types. Given some abstract axiomatic description @{text P} |
|
1144 |
of a type, this involves two steps: |
|
1145 |
||
1146 |
\begin{enumerate} |
|
1147 |
||
1148 |
\item Find an appropriate type @{text \<tau>} and subset @{text A} which |
|
1149 |
has the desired properties @{text P}, and make a type definition |
|
1150 |
based on this representation. |
|
1151 |
||
1152 |
\item Prove that @{text P} holds for @{text \<tau>} by lifting @{text P} |
|
1153 |
from the representation. |
|
26849 | 1154 |
|
42908 | 1155 |
\end{enumerate} |
1156 |
||
1157 |
You can later forget about the representation and work solely in |
|
1158 |
terms of the abstract properties @{text P}. |
|
1159 |
||
1160 |
\medskip The following trivial example pulls a three-element type |
|
1161 |
into existence within the formal logical environment of HOL. *} |
|
1162 |
||
49834 | 1163 |
typedef three = "{(True, True), (True, False), (False, True)}" |
42908 | 1164 |
by blast |
1165 |
||
1166 |
definition "One = Abs_three (True, True)" |
|
1167 |
definition "Two = Abs_three (True, False)" |
|
1168 |
definition "Three = Abs_three (False, True)" |
|
1169 |
||
1170 |
lemma three_distinct: "One \<noteq> Two" "One \<noteq> Three" "Two \<noteq> Three" |
|
49812
e3945ddcb9aa
eliminated some remaining uses of typedef with implicit set definition;
wenzelm
parents:
48985
diff
changeset
|
1171 |
by (simp_all add: One_def Two_def Three_def Abs_three_inject) |
42908 | 1172 |
|
1173 |
lemma three_cases: |
|
1174 |
fixes x :: three obtains "x = One" | "x = Two" | "x = Three" |
|
49812
e3945ddcb9aa
eliminated some remaining uses of typedef with implicit set definition;
wenzelm
parents:
48985
diff
changeset
|
1175 |
by (cases x) (auto simp: One_def Two_def Three_def Abs_three_inject) |
42908 | 1176 |
|
1177 |
text {* Note that such trivial constructions are better done with |
|
1178 |
derived specification mechanisms such as @{command datatype}: *} |
|
1179 |
||
1180 |
datatype three' = One' | Two' | Three' |
|
1181 |
||
1182 |
text {* This avoids re-doing basic definitions and proofs from the |
|
1183 |
primitive @{command typedef} above. *} |
|
26849 | 1184 |
|
1185 |
||
50109 | 1186 |
|
41396 | 1187 |
section {* Functorial structure of types *} |
1188 |
||
1189 |
text {* |
|
1190 |
\begin{matharray}{rcl} |
|
41505
6d19301074cf
"enriched_type" replaces less specific "type_lifting"
haftmann
parents:
41396
diff
changeset
|
1191 |
@{command_def (HOL) "enriched_type"} & : & @{text "local_theory \<rightarrow> proof(prove)"} |
41396 | 1192 |
\end{matharray} |
1193 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1194 |
@{rail " |
42617 | 1195 |
@@{command (HOL) enriched_type} (@{syntax name} ':')? @{syntax term} |
41396 | 1196 |
; |
42617 | 1197 |
"} |
41396 | 1198 |
|
1199 |
\begin{description} |
|
1200 |
||
42617 | 1201 |
\item @{command (HOL) "enriched_type"}~@{text "prefix: m"} allows to |
1202 |
prove and register properties about the functorial structure of type |
|
1203 |
constructors. These properties then can be used by other packages |
|
1204 |
to deal with those type constructors in certain type constructions. |
|
1205 |
Characteristic theorems are noted in the current local theory. By |
|
1206 |
default, they are prefixed with the base name of the type |
|
1207 |
constructor, an explicit prefix can be given alternatively. |
|
41396 | 1208 |
|
1209 |
The given term @{text "m"} is considered as \emph{mapper} for the |
|
1210 |
corresponding type constructor and must conform to the following |
|
1211 |
type pattern: |
|
1212 |
||
1213 |
\begin{matharray}{lll} |
|
1214 |
@{text "m"} & @{text "::"} & |
|
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1215 |
@{text "\<sigma>\<^sub>1 \<Rightarrow> \<dots> \<sigma>\<^sub>k \<Rightarrow> (\<^vec>\<alpha>\<^sub>n) t \<Rightarrow> (\<^vec>\<beta>\<^sub>n) t"} \\ |
41396 | 1216 |
\end{matharray} |
1217 |
||
1218 |
\noindent where @{text t} is the type constructor, @{text |
|
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1219 |
"\<^vec>\<alpha>\<^sub>n"} and @{text "\<^vec>\<beta>\<^sub>n"} are distinct |
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1220 |
type variables free in the local theory and @{text "\<sigma>\<^sub>1"}, |
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1221 |
\ldots, @{text "\<sigma>\<^sub>k"} is a subsequence of @{text "\<alpha>\<^sub>1 \<Rightarrow> |
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1222 |
\<beta>\<^sub>1"}, @{text "\<beta>\<^sub>1 \<Rightarrow> \<alpha>\<^sub>1"}, \ldots, |
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1223 |
@{text "\<alpha>\<^sub>n \<Rightarrow> \<beta>\<^sub>n"}, @{text "\<beta>\<^sub>n \<Rightarrow> |
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1224 |
\<alpha>\<^sub>n"}. |
41396 | 1225 |
|
1226 |
\end{description} |
|
1227 |
*} |
|
1228 |
||
47859 | 1229 |
|
50109 | 1230 |
section {* Quotient types *} |
1231 |
||
1232 |
text {* |
|
1233 |
\begin{matharray}{rcl} |
|
1234 |
@{command_def (HOL) "quotient_type"} & : & @{text "local_theory \<rightarrow> proof(prove)"}\\ |
|
1235 |
@{command_def (HOL) "quotient_definition"} & : & @{text "local_theory \<rightarrow> proof(prove)"}\\ |
|
1236 |
@{command_def (HOL) "print_quotmapsQ3"} & : & @{text "context \<rightarrow>"}\\ |
|
1237 |
@{command_def (HOL) "print_quotientsQ3"} & : & @{text "context \<rightarrow>"}\\ |
|
1238 |
@{command_def (HOL) "print_quotconsts"} & : & @{text "context \<rightarrow>"}\\ |
|
1239 |
@{method_def (HOL) "lifting"} & : & @{text method} \\ |
|
1240 |
@{method_def (HOL) "lifting_setup"} & : & @{text method} \\ |
|
1241 |
@{method_def (HOL) "descending"} & : & @{text method} \\ |
|
1242 |
@{method_def (HOL) "descending_setup"} & : & @{text method} \\ |
|
1243 |
@{method_def (HOL) "partiality_descending"} & : & @{text method} \\ |
|
1244 |
@{method_def (HOL) "partiality_descending_setup"} & : & @{text method} \\ |
|
1245 |
@{method_def (HOL) "regularize"} & : & @{text method} \\ |
|
1246 |
@{method_def (HOL) "injection"} & : & @{text method} \\ |
|
1247 |
@{method_def (HOL) "cleaning"} & : & @{text method} \\ |
|
1248 |
@{attribute_def (HOL) "quot_thm"} & : & @{text attribute} \\ |
|
1249 |
@{attribute_def (HOL) "quot_lifted"} & : & @{text attribute} \\ |
|
1250 |
@{attribute_def (HOL) "quot_respect"} & : & @{text attribute} \\ |
|
1251 |
@{attribute_def (HOL) "quot_preserve"} & : & @{text attribute} \\ |
|
1252 |
\end{matharray} |
|
1253 |
||
1254 |
The quotient package defines a new quotient type given a raw type |
|
1255 |
and a partial equivalence relation. It also includes automation for |
|
1256 |
transporting definitions and theorems. It can automatically produce |
|
1257 |
definitions and theorems on the quotient type, given the |
|
1258 |
corresponding constants and facts on the raw type. |
|
1259 |
||
1260 |
@{rail " |
|
50877 | 1261 |
@@{command (HOL) quotient_type} (spec); |
50109 | 1262 |
|
1263 |
spec: @{syntax typespec} @{syntax mixfix}? '=' \\ |
|
1264 |
@{syntax type} '/' ('partial' ':')? @{syntax term} \\ |
|
1265 |
(@'morphisms' @{syntax name} @{syntax name})?; |
|
1266 |
"} |
|
1267 |
||
1268 |
@{rail " |
|
1269 |
@@{command (HOL) quotient_definition} constdecl? @{syntax thmdecl}? \\ |
|
1270 |
@{syntax term} 'is' @{syntax term}; |
|
1271 |
||
1272 |
constdecl: @{syntax name} ('::' @{syntax type})? @{syntax mixfix}? |
|
1273 |
"} |
|
1274 |
||
1275 |
@{rail " |
|
1276 |
@@{method (HOL) lifting} @{syntax thmrefs}? |
|
1277 |
; |
|
1278 |
||
1279 |
@@{method (HOL) lifting_setup} @{syntax thmrefs}? |
|
1280 |
; |
|
1281 |
"} |
|
1282 |
||
1283 |
\begin{description} |
|
1284 |
||
1285 |
\item @{command (HOL) "quotient_type"} defines quotient types. The |
|
1286 |
injection from a quotient type to a raw type is called @{text |
|
1287 |
rep_t}, its inverse @{text abs_t} unless explicit @{keyword (HOL) |
|
1288 |
"morphisms"} specification provides alternative names. @{command |
|
1289 |
(HOL) "quotient_type"} requires the user to prove that the relation |
|
1290 |
is an equivalence relation (predicate @{text equivp}), unless the |
|
52895
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1291 |
user specifies explicitly @{text partial} in which case the |
50109 | 1292 |
obligation is @{text part_equivp}. A quotient defined with @{text |
1293 |
partial} is weaker in the sense that less things can be proved |
|
1294 |
automatically. |
|
1295 |
||
1296 |
\item @{command (HOL) "quotient_definition"} defines a constant on |
|
1297 |
the quotient type. |
|
1298 |
||
1299 |
\item @{command (HOL) "print_quotmapsQ3"} prints quotient map |
|
1300 |
functions. |
|
1301 |
||
1302 |
\item @{command (HOL) "print_quotientsQ3"} prints quotients. |
|
1303 |
||
1304 |
\item @{command (HOL) "print_quotconsts"} prints quotient constants. |
|
1305 |
||
1306 |
\item @{method (HOL) "lifting"} and @{method (HOL) "lifting_setup"} |
|
1307 |
methods match the current goal with the given raw theorem to be |
|
1308 |
lifted producing three new subgoals: regularization, injection and |
|
1309 |
cleaning subgoals. @{method (HOL) "lifting"} tries to apply the |
|
1310 |
heuristics for automatically solving these three subgoals and |
|
1311 |
leaves only the subgoals unsolved by the heuristics to the user as |
|
1312 |
opposed to @{method (HOL) "lifting_setup"} which leaves the three |
|
1313 |
subgoals unsolved. |
|
1314 |
||
1315 |
\item @{method (HOL) "descending"} and @{method (HOL) |
|
1316 |
"descending_setup"} try to guess a raw statement that would lift |
|
1317 |
to the current subgoal. Such statement is assumed as a new subgoal |
|
1318 |
and @{method (HOL) "descending"} continues in the same way as |
|
1319 |
@{method (HOL) "lifting"} does. @{method (HOL) "descending"} tries |
|
1320 |
to solve the arising regularization, injection and cleaning |
|
52895
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1321 |
subgoals with the analogous method @{method (HOL) |
50109 | 1322 |
"descending_setup"} which leaves the four unsolved subgoals. |
1323 |
||
1324 |
\item @{method (HOL) "partiality_descending"} finds the regularized |
|
1325 |
theorem that would lift to the current subgoal, lifts it and |
|
1326 |
leaves as a subgoal. This method can be used with partial |
|
1327 |
equivalence quotients where the non regularized statements would |
|
1328 |
not be true. @{method (HOL) "partiality_descending_setup"} leaves |
|
1329 |
the injection and cleaning subgoals unchanged. |
|
1330 |
||
1331 |
\item @{method (HOL) "regularize"} applies the regularization |
|
1332 |
heuristics to the current subgoal. |
|
1333 |
||
1334 |
\item @{method (HOL) "injection"} applies the injection heuristics |
|
1335 |
to the current goal using the stored quotient respectfulness |
|
1336 |
theorems. |
|
1337 |
||
1338 |
\item @{method (HOL) "cleaning"} applies the injection cleaning |
|
1339 |
heuristics to the current subgoal using the stored quotient |
|
1340 |
preservation theorems. |
|
1341 |
||
1342 |
\item @{attribute (HOL) quot_lifted} attribute tries to |
|
1343 |
automatically transport the theorem to the quotient type. |
|
1344 |
The attribute uses all the defined quotients types and quotient |
|
1345 |
constants often producing undesired results or theorems that |
|
1346 |
cannot be lifted. |
|
1347 |
||
1348 |
\item @{attribute (HOL) quot_respect} and @{attribute (HOL) |
|
1349 |
quot_preserve} attributes declare a theorem as a respectfulness |
|
1350 |
and preservation theorem respectively. These are stored in the |
|
1351 |
local theory store and used by the @{method (HOL) "injection"} |
|
1352 |
and @{method (HOL) "cleaning"} methods respectively. |
|
1353 |
||
1354 |
\item @{attribute (HOL) quot_thm} declares that a certain theorem |
|
1355 |
is a quotient extension theorem. Quotient extension theorems |
|
1356 |
allow for quotienting inside container types. Given a polymorphic |
|
1357 |
type that serves as a container, a map function defined for this |
|
1358 |
container using @{command (HOL) "enriched_type"} and a relation |
|
1359 |
map defined for for the container type, the quotient extension |
|
1360 |
theorem should be @{term "Quotient3 R Abs Rep \<Longrightarrow> Quotient3 |
|
1361 |
(rel_map R) (map Abs) (map Rep)"}. Quotient extension theorems |
|
1362 |
are stored in a database and are used all the steps of lifting |
|
1363 |
theorems. |
|
1364 |
||
1365 |
\end{description} |
|
1366 |
*} |
|
1367 |
||
1368 |
||
1369 |
||
1370 |
section {* Definition by specification \label{sec:hol-specification} *} |
|
1371 |
||
1372 |
text {* |
|
1373 |
\begin{matharray}{rcl} |
|
1374 |
@{command_def (HOL) "specification"} & : & @{text "theory \<rightarrow> proof(prove)"} \\ |
|
1375 |
@{command_def (HOL) "ax_specification"} & : & @{text "theory \<rightarrow> proof(prove)"} \\ |
|
1376 |
\end{matharray} |
|
1377 |
||
1378 |
@{rail " |
|
1379 |
(@@{command (HOL) specification} | @@{command (HOL) ax_specification}) |
|
1380 |
'(' (decl +) ')' \\ (@{syntax thmdecl}? @{syntax prop} +) |
|
1381 |
; |
|
1382 |
decl: ((@{syntax name} ':')? @{syntax term} '(' @'overloaded' ')'?) |
|
1383 |
"} |
|
1384 |
||
1385 |
\begin{description} |
|
1386 |
||
1387 |
\item @{command (HOL) "specification"}~@{text "decls \<phi>"} sets up a |
|
1388 |
goal stating the existence of terms with the properties specified to |
|
1389 |
hold for the constants given in @{text decls}. After finishing the |
|
1390 |
proof, the theory will be augmented with definitions for the given |
|
1391 |
constants, as well as with theorems stating the properties for these |
|
1392 |
constants. |
|
1393 |
||
1394 |
\item @{command (HOL) "ax_specification"}~@{text "decls \<phi>"} sets up |
|
1395 |
a goal stating the existence of terms with the properties specified |
|
1396 |
to hold for the constants given in @{text decls}. After finishing |
|
1397 |
the proof, the theory will be augmented with axioms expressing the |
|
1398 |
properties given in the first place. |
|
1399 |
||
1400 |
\item @{text decl} declares a constant to be defined by the |
|
1401 |
specification given. The definition for the constant @{text c} is |
|
1402 |
bound to the name @{text c_def} unless a theorem name is given in |
|
1403 |
the declaration. Overloaded constants should be declared as such. |
|
1404 |
||
1405 |
\end{description} |
|
1406 |
||
1407 |
Whether to use @{command (HOL) "specification"} or @{command (HOL) |
|
1408 |
"ax_specification"} is to some extent a matter of style. @{command |
|
1409 |
(HOL) "specification"} introduces no new axioms, and so by |
|
1410 |
construction cannot introduce inconsistencies, whereas @{command |
|
1411 |
(HOL) "ax_specification"} does introduce axioms, but only after the |
|
1412 |
user has explicitly proven it to be safe. A practical issue must be |
|
1413 |
considered, though: After introducing two constants with the same |
|
1414 |
properties using @{command (HOL) "specification"}, one can prove |
|
1415 |
that the two constants are, in fact, equal. If this might be a |
|
1416 |
problem, one should use @{command (HOL) "ax_specification"}. |
|
1417 |
*} |
|
1418 |
||
52895
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1419 |
section {* Adhoc overloading of constants *} |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1420 |
|
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1421 |
text {* |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1422 |
\begin{tabular}{rcll} |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1423 |
@{command_def "adhoc_overloading"} & : & @{text "local_theory \<rightarrow> local_theory"} \\ |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1424 |
@{command_def "no_adhoc_overloading"} & : & @{text "local_theory \<rightarrow> local_theory"} \\ |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1425 |
@{attribute_def "show_variants"} & : & @{text "attribute"} & default @{text false} \\ |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1426 |
\end{tabular} |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1427 |
|
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1428 |
\medskip |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1429 |
|
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1430 |
Adhoc overloading allows to overload a constant depending on |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1431 |
its type. Typically this involves the introduction of an |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1432 |
uninterpreted constant (used for input and output) and the addition |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1433 |
of some variants (used internally). For examples see |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1434 |
@{file "~~/src/HOL/ex/Adhoc_Overloading_Examples.thy"} and |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1435 |
@{file "~~/src/HOL/Library/Monad_Syntax.thy"}. |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1436 |
|
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1437 |
@{rail " |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1438 |
(@@{command adhoc_overloading} | @@{command no_adhoc_overloading}) |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1439 |
(@{syntax nameref} (@{syntax term} + ) + @'and') |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1440 |
"} |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1441 |
|
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1442 |
\begin{description} |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1443 |
|
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1444 |
\item @{command "adhoc_overloading"}~@{text "c v\<^sub>1 ... v\<^sub>n"} |
52895
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1445 |
associates variants with an existing constant. |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1446 |
|
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1447 |
\item @{command "no_adhoc_overloading"} is similar to |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1448 |
@{command "adhoc_overloading"}, but removes the specified variants |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1449 |
from the present context. |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1450 |
|
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1451 |
\item @{attribute "show_variants"} controls printing of variants |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1452 |
of overloaded constants. If enabled, the internally used variants |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1453 |
are printed instead of their respective overloaded constants. This |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1454 |
is occasionally useful to check whether the system agrees with a |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1455 |
user's expectations about derived variants. |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1456 |
|
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1457 |
\end{description} |
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1458 |
*} |
50109 | 1459 |
|
1460 |
chapter {* Proof tools *} |
|
1461 |
||
1462 |
section {* Adhoc tuples *} |
|
1463 |
||
1464 |
text {* |
|
1465 |
\begin{matharray}{rcl} |
|
1466 |
@{attribute_def (HOL) split_format}@{text "\<^sup>*"} & : & @{text attribute} \\ |
|
1467 |
\end{matharray} |
|
1468 |
||
1469 |
@{rail " |
|
1470 |
@@{attribute (HOL) split_format} ('(' 'complete' ')')? |
|
1471 |
"} |
|
1472 |
||
1473 |
\begin{description} |
|
1474 |
||
1475 |
\item @{attribute (HOL) split_format}\ @{text "(complete)"} causes |
|
1476 |
arguments in function applications to be represented canonically |
|
1477 |
according to their tuple type structure. |
|
1478 |
||
1479 |
Note that this operation tends to invent funny names for new local |
|
1480 |
parameters introduced. |
|
1481 |
||
1482 |
\end{description} |
|
1483 |
*} |
|
1484 |
||
1485 |
||
47821 | 1486 |
section {* Transfer package *} |
1487 |
||
1488 |
text {* |
|
1489 |
\begin{matharray}{rcl} |
|
1490 |
@{method_def (HOL) "transfer"} & : & @{text method} \\ |
|
1491 |
@{method_def (HOL) "transfer'"} & : & @{text method} \\ |
|
1492 |
@{method_def (HOL) "transfer_prover"} & : & @{text method} \\ |
|
1493 |
@{attribute_def (HOL) "transfer_rule"} & : & @{text attribute} \\ |
|
1494 |
@{attribute_def (HOL) "relator_eq"} & : & @{text attribute} \\ |
|
1495 |
\end{matharray} |
|
1496 |
||
1497 |
\begin{description} |
|
1498 |
||
1499 |
\item @{method (HOL) "transfer"} method replaces the current subgoal |
|
1500 |
with a logically equivalent one that uses different types and |
|
1501 |
constants. The replacement of types and constants is guided by the |
|
1502 |
database of transfer rules. Goals are generalized over all free |
|
1503 |
variables by default; this is necessary for variables whose types |
|
1504 |
change, but can be overridden for specific variables with e.g. |
|
1505 |
@{text "transfer fixing: x y z"}. |
|
1506 |
||
1507 |
\item @{method (HOL) "transfer'"} is a variant of @{method (HOL) |
|
1508 |
transfer} that allows replacing a subgoal with one that is |
|
1509 |
logically stronger (rather than equivalent). For example, a |
|
1510 |
subgoal involving equality on a quotient type could be replaced |
|
1511 |
with a subgoal involving equality (instead of the corresponding |
|
1512 |
equivalence relation) on the underlying raw type. |
|
1513 |
||
1514 |
\item @{method (HOL) "transfer_prover"} method assists with proving |
|
1515 |
a transfer rule for a new constant, provided the constant is |
|
1516 |
defined in terms of other constants that already have transfer |
|
1517 |
rules. It should be applied after unfolding the constant |
|
1518 |
definitions. |
|
1519 |
||
1520 |
\item @{attribute (HOL) "transfer_rule"} attribute maintains a |
|
1521 |
collection of transfer rules, which relate constants at two |
|
1522 |
different types. Typical transfer rules may relate different type |
|
1523 |
instances of the same polymorphic constant, or they may relate an |
|
1524 |
operation on a raw type to a corresponding operation on an |
|
1525 |
abstract type (quotient or subtype). For example: |
|
1526 |
||
1527 |
@{text "((A ===> B) ===> list_all2 A ===> list_all2 B) map map"}\\ |
|
1528 |
@{text "(cr_int ===> cr_int ===> cr_int) (\<lambda>(x,y) (u,v). (x+u, y+v)) plus"} |
|
1529 |
||
1530 |
Lemmas involving predicates on relations can also be registered |
|
1531 |
using the same attribute. For example: |
|
1532 |
||
1533 |
@{text "bi_unique A \<Longrightarrow> (list_all2 A ===> op =) distinct distinct"}\\ |
|
1534 |
@{text "\<lbrakk>bi_unique A; bi_unique B\<rbrakk> \<Longrightarrow> bi_unique (prod_rel A B)"} |
|
1535 |
||
1536 |
\item @{attribute (HOL) relator_eq} attribute collects identity laws |
|
1537 |
for relators of various type constructors, e.g. @{text "list_all2 |
|
1538 |
(op =) = (op =)"}. The @{method (HOL) transfer} method uses these |
|
1539 |
lemmas to infer transfer rules for non-polymorphic constants on |
|
1540 |
the fly. |
|
1541 |
||
1542 |
\end{description} |
|
1543 |
||
1544 |
*} |
|
1545 |
||
47859 | 1546 |
|
47802 | 1547 |
section {* Lifting package *} |
1548 |
||
1549 |
text {* |
|
1550 |
\begin{matharray}{rcl} |
|
1551 |
@{command_def (HOL) "setup_lifting"} & : & @{text "local_theory \<rightarrow> local_theory"}\\ |
|
1552 |
@{command_def (HOL) "lift_definition"} & : & @{text "local_theory \<rightarrow> proof(prove)"}\\ |
|
53219
ca237b9e4542
use only one data slot; rename print_quotmaps to print_quot_maps; tuned
kuncar
parents:
53015
diff
changeset
|
1553 |
@{command_def (HOL) "print_quot_maps"} & : & @{text "context \<rightarrow>"}\\ |
47802 | 1554 |
@{command_def (HOL) "print_quotients"} & : & @{text "context \<rightarrow>"}\\ |
1555 |
@{attribute_def (HOL) "quot_map"} & : & @{text attribute} \\ |
|
1556 |
@{attribute_def (HOL) "invariant_commute"} & : & @{text attribute} \\ |
|
50877 | 1557 |
@{attribute_def (HOL) "reflexivity_rule"} & : & @{text attribute} \\ |
1558 |
@{attribute_def (HOL) "quot_del"} & : & @{text attribute} |
|
47802 | 1559 |
\end{matharray} |
1560 |
||
1561 |
@{rail " |
|
50877 | 1562 |
@@{command (HOL) setup_lifting} ('(' 'no_code' ')')? \\ |
47802 | 1563 |
@{syntax thmref} @{syntax thmref}?; |
1564 |
"} |
|
1565 |
||
1566 |
@{rail " |
|
1567 |
@@{command (HOL) lift_definition} @{syntax name} '::' @{syntax type} @{syntax mixfix}? \\ |
|
1568 |
'is' @{syntax term}; |
|
1569 |
"} |
|
1570 |
||
1571 |
\begin{description} |
|
1572 |
||
47859 | 1573 |
\item @{command (HOL) "setup_lifting"} Sets up the Lifting package |
1574 |
to work with a user-defined type. The user must provide either a |
|
1575 |
quotient theorem @{text "Quotient R Abs Rep T"} or a |
|
1576 |
type_definition theorem @{text "type_definition Rep Abs A"}. The |
|
1577 |
package configures transfer rules for equality and quantifiers on |
|
1578 |
the type, and sets up the @{command_def (HOL) "lift_definition"} |
|
1579 |
command to work with the type. In the case of a quotient theorem, |
|
1580 |
an optional theorem @{text "reflp R"} can be provided as a second |
|
1581 |
argument. This allows the package to generate stronger transfer |
|
1582 |
rules. |
|
1583 |
||
1584 |
@{command (HOL) "setup_lifting"} is called automatically if a |
|
1585 |
quotient type is defined by the command @{command (HOL) |
|
1586 |
"quotient_type"} from the Quotient package. |
|
1587 |
||
1588 |
If @{command (HOL) "setup_lifting"} is called with a |
|
1589 |
type_definition theorem, the abstract type implicitly defined by |
|
1590 |
the theorem is declared as an abstract type in the code |
|
1591 |
generator. This allows @{command (HOL) "lift_definition"} to |
|
1592 |
register (generated) code certificate theorems as abstract code |
|
50877 | 1593 |
equations in the code generator. The option @{text "no_code"} |
47859 | 1594 |
of the command @{command (HOL) "setup_lifting"} can turn off that |
1595 |
behavior and causes that code certificate theorems generated by |
|
52895
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1596 |
@{command (HOL) "lift_definition"} are not registered as abstract |
47859 | 1597 |
code equations. |
1598 |
||
1599 |
\item @{command (HOL) "lift_definition"} @{text "f :: \<tau> is t"} |
|
1600 |
Defines a new function @{text f} with an abstract type @{text \<tau>} |
|
1601 |
in terms of a corresponding operation @{text t} on a |
|
1602 |
representation type. The term @{text t} doesn't have to be |
|
1603 |
necessarily a constant but it can be any term. |
|
47802 | 1604 |
|
1605 |
Users must discharge a respectfulness proof obligation when each |
|
47859 | 1606 |
constant is defined. For a type copy, i.e. a typedef with @{text |
1607 |
UNIV}, the proof is discharged automatically. The obligation is |
|
47802 | 1608 |
presented in a user-friendly, readable form. A respectfulness |
47859 | 1609 |
theorem in the standard format @{text f.rsp} and a transfer rule |
1610 |
@{text f.tranfer} for the Transfer package are generated by the |
|
1611 |
package. |
|
47802 | 1612 |
|
50879 | 1613 |
For each constant defined through trivial quotients (type copies or |
1614 |
subtypes) @{text f.rep_eq} is generated. The equation is a code certificate |
|
1615 |
that defines @{text f} using the representation function. |
|
1616 |
||
1617 |
For each constant @{text f.abs_eq} is generated. The equation is unconditional |
|
1618 |
for total quotients. The equation defines @{text f} using |
|
1619 |
the abstraction function. |
|
1620 |
||
1621 |
Integration with code_abstype: For subtypes (e.g., |
|
47859 | 1622 |
corresponding to a datatype invariant, such as dlist), @{command |
50879 | 1623 |
(HOL) "lift_definition"} uses a code certificate theorem |
1624 |
@{text f.rep_eq} as a code equation. |
|
1625 |
||
1626 |
Integration with code: For total quotients, @{command |
|
1627 |
(HOL) "lift_definition"} uses @{text f.abs_eq} as a code equation. |
|
47802 | 1628 |
|
53219
ca237b9e4542
use only one data slot; rename print_quotmaps to print_quot_maps; tuned
kuncar
parents:
53015
diff
changeset
|
1629 |
\item @{command (HOL) "print_quot_maps"} prints stored quotient map |
47859 | 1630 |
theorems. |
1631 |
||
1632 |
\item @{command (HOL) "print_quotients"} prints stored quotient |
|
1633 |
theorems. |
|
1634 |
||
1635 |
\item @{attribute (HOL) quot_map} registers a quotient map |
|
1636 |
theorem. For examples see @{file |
|
1637 |
"~~/src/HOL/Library/Quotient_List.thy"} or other Quotient_*.thy |
|
1638 |
files. |
|
1639 |
||
50877 | 1640 |
\item @{attribute (HOL) invariant_commute} registers a theorem that |
47859 | 1641 |
shows a relationship between the constant @{text |
1642 |
Lifting.invariant} (used for internal encoding of proper subtypes) |
|
1643 |
and a relator. Such theorems allows the package to hide @{text |
|
1644 |
Lifting.invariant} from a user in a user-readable form of a |
|
1645 |
respectfulness theorem. For examples see @{file |
|
1646 |
"~~/src/HOL/Library/Quotient_List.thy"} or other Quotient_*.thy |
|
1647 |
files. |
|
47802 | 1648 |
|
50877 | 1649 |
\item @{attribute (HOL) reflexivity_rule} registers a theorem that shows |
52895
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
1650 |
that a relator respects reflexivity and left-totality. For examples |
50877 | 1651 |
see @{file "~~/src/HOL/Library/Quotient_List.thy"} or other Quotient_*.thy |
1652 |
The property is used in generation of abstraction function equations. |
|
1653 |
||
1654 |
\item @{attribute (HOL) quot_del} deletes a corresponding Quotient theorem |
|
1655 |
from the Lifting infrastructure and thus de-register the corresponding quotient. |
|
1656 |
This effectively causes that @{command (HOL) lift_definition} will not |
|
1657 |
do any lifting for the corresponding type. It serves mainly for hiding |
|
1658 |
of type construction details when the construction is done. See for example |
|
1659 |
@{file "~~/src/HOL/Int.thy"}. |
|
47802 | 1660 |
\end{description} |
1661 |
*} |
|
1662 |
||
47859 | 1663 |
|
43994 | 1664 |
section {* Coercive subtyping *} |
1665 |
||
1666 |
text {* |
|
1667 |
\begin{matharray}{rcl} |
|
1668 |
@{attribute_def (HOL) coercion} & : & @{text attribute} \\ |
|
1669 |
@{attribute_def (HOL) coercion_enabled} & : & @{text attribute} \\ |
|
1670 |
@{attribute_def (HOL) coercion_map} & : & @{text attribute} \\ |
|
1671 |
\end{matharray} |
|
1672 |
||
46280 | 1673 |
Coercive subtyping allows the user to omit explicit type |
1674 |
conversions, also called \emph{coercions}. Type inference will add |
|
1675 |
them as necessary when parsing a term. See |
|
1676 |
\cite{traytel-berghofer-nipkow-2011} for details. |
|
1677 |
||
43994 | 1678 |
@{rail " |
1679 |
@@{attribute (HOL) coercion} (@{syntax term})? |
|
1680 |
; |
|
1681 |
"} |
|
1682 |
@{rail " |
|
1683 |
@@{attribute (HOL) coercion_map} (@{syntax term})? |
|
1684 |
; |
|
1685 |
"} |
|
1686 |
||
1687 |
\begin{description} |
|
1688 |
||
1689 |
\item @{attribute (HOL) "coercion"}~@{text "f"} registers a new |
|
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1690 |
coercion function @{text "f :: \<sigma>\<^sub>1 \<Rightarrow> \<sigma>\<^sub>2"} where @{text "\<sigma>\<^sub>1"} and |
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1691 |
@{text "\<sigma>\<^sub>2"} are type constructors without arguments. Coercions are |
46280 | 1692 |
composed by the inference algorithm if needed. Note that the type |
1693 |
inference algorithm is complete only if the registered coercions |
|
1694 |
form a lattice. |
|
43994 | 1695 |
|
46280 | 1696 |
\item @{attribute (HOL) "coercion_map"}~@{text "map"} registers a |
1697 |
new map function to lift coercions through type constructors. The |
|
1698 |
function @{text "map"} must conform to the following type pattern |
|
43994 | 1699 |
|
1700 |
\begin{matharray}{lll} |
|
1701 |
@{text "map"} & @{text "::"} & |
|
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1702 |
@{text "f\<^sub>1 \<Rightarrow> \<dots> \<Rightarrow> f\<^sub>n \<Rightarrow> (\<alpha>\<^sub>1, \<dots>, \<alpha>\<^sub>n) t \<Rightarrow> (\<beta>\<^sub>1, \<dots>, \<beta>\<^sub>n) t"} \\ |
43994 | 1703 |
\end{matharray} |
1704 |
||
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1705 |
where @{text "t"} is a type constructor and @{text "f\<^sub>i"} is of type |
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1706 |
@{text "\<alpha>\<^sub>i \<Rightarrow> \<beta>\<^sub>i"} or @{text "\<beta>\<^sub>i \<Rightarrow> \<alpha>\<^sub>i"}. Registering a map function |
46280 | 1707 |
overwrites any existing map function for this particular type |
1708 |
constructor. |
|
43994 | 1709 |
|
1710 |
\item @{attribute (HOL) "coercion_enabled"} enables the coercion |
|
1711 |
inference algorithm. |
|
1712 |
||
1713 |
\end{description} |
|
1714 |
*} |
|
1715 |
||
1716 |
||
26849 | 1717 |
section {* Arithmetic proof support *} |
1718 |
||
1719 |
text {* |
|
1720 |
\begin{matharray}{rcl} |
|
28761
9ec4482c9201
updated/refined types of Isar language elements, removed special LaTeX macros;
wenzelm
parents:
28760
diff
changeset
|
1721 |
@{method_def (HOL) arith} & : & @{text method} \\ |
30863 | 1722 |
@{attribute_def (HOL) arith} & : & @{text attribute} \\ |
28761
9ec4482c9201
updated/refined types of Isar language elements, removed special LaTeX macros;
wenzelm
parents:
28760
diff
changeset
|
1723 |
@{attribute_def (HOL) arith_split} & : & @{text attribute} \\ |
26849 | 1724 |
\end{matharray} |
1725 |
||
46280 | 1726 |
\begin{description} |
26849 | 1727 |
|
46280 | 1728 |
\item @{method (HOL) arith} decides linear arithmetic problems (on |
1729 |
types @{text nat}, @{text int}, @{text real}). Any current facts |
|
1730 |
are inserted into the goal before running the procedure. |
|
26849 | 1731 |
|
46280 | 1732 |
\item @{attribute (HOL) arith} declares facts that are supplied to |
1733 |
the arithmetic provers implicitly. |
|
1734 |
||
1735 |
\item @{attribute (HOL) arith_split} attribute declares case split |
|
30865 | 1736 |
rules to be expanded before @{method (HOL) arith} is invoked. |
30863 | 1737 |
|
46280 | 1738 |
\end{description} |
1739 |
||
1740 |
Note that a simpler (but faster) arithmetic prover is already |
|
1741 |
invoked by the Simplifier. |
|
26849 | 1742 |
*} |
1743 |
||
1744 |
||
30169 | 1745 |
section {* Intuitionistic proof search *} |
1746 |
||
1747 |
text {* |
|
1748 |
\begin{matharray}{rcl} |
|
30171 | 1749 |
@{method_def (HOL) iprover} & : & @{text method} \\ |
30169 | 1750 |
\end{matharray} |
1751 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1752 |
@{rail " |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1753 |
@@{method (HOL) iprover} ( @{syntax rulemod} * ) |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1754 |
"} |
30169 | 1755 |
|
46280 | 1756 |
\begin{description} |
1757 |
||
1758 |
\item @{method (HOL) iprover} performs intuitionistic proof search, |
|
1759 |
depending on specifically declared rules from the context, or given |
|
1760 |
as explicit arguments. Chained facts are inserted into the goal |
|
1761 |
before commencing proof search. |
|
35613 | 1762 |
|
30169 | 1763 |
Rules need to be classified as @{attribute (Pure) intro}, |
1764 |
@{attribute (Pure) elim}, or @{attribute (Pure) dest}; here the |
|
1765 |
``@{text "!"}'' indicator refers to ``safe'' rules, which may be |
|
1766 |
applied aggressively (without considering back-tracking later). |
|
1767 |
Rules declared with ``@{text "?"}'' are ignored in proof search (the |
|
42626 | 1768 |
single-step @{method (Pure) rule} method still observes these). An |
30169 | 1769 |
explicit weight annotation may be given as well; otherwise the |
1770 |
number of rule premises will be taken into account here. |
|
46280 | 1771 |
|
1772 |
\end{description} |
|
30169 | 1773 |
*} |
1774 |
||
46280 | 1775 |
|
43578
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1776 |
section {* Model Elimination and Resolution *} |
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1777 |
|
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1778 |
text {* |
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1779 |
\begin{matharray}{rcl} |
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1780 |
@{method_def (HOL) "meson"} & : & @{text method} \\ |
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1781 |
@{method_def (HOL) "metis"} & : & @{text method} \\ |
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1782 |
\end{matharray} |
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1783 |
|
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1784 |
@{rail " |
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1785 |
@@{method (HOL) meson} @{syntax thmrefs}? |
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1786 |
; |
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1787 |
|
46280 | 1788 |
@@{method (HOL) metis} |
1789 |
('(' ('partial_types' | 'full_types' | 'no_types' | @{syntax name}) ')')? |
|
1790 |
@{syntax thmrefs}? |
|
43578
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1791 |
"} |
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1792 |
|
46280 | 1793 |
\begin{description} |
1794 |
||
1795 |
\item @{method (HOL) meson} implements Loveland's model elimination |
|
1796 |
procedure \cite{loveland-78}. See @{file |
|
1797 |
"~~/src/HOL/ex/Meson_Test.thy"} for examples. |
|
43578
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1798 |
|
46280 | 1799 |
\item @{method (HOL) metis} combines ordered resolution and ordered |
1800 |
paramodulation to find first-order (or mildly higher-order) proofs. |
|
1801 |
The first optional argument specifies a type encoding; see the |
|
1802 |
Sledgehammer manual \cite{isabelle-sledgehammer} for details. The |
|
1803 |
directory @{file "~~/src/HOL/Metis_Examples"} contains several small |
|
1804 |
theories developed to a large extent using @{method (HOL) metis}. |
|
1805 |
||
1806 |
\end{description} |
|
43578
36ba44fe0781
document "meson" and "metis" in HOL specific section of the Isar ref manual
blanchet
parents:
43270
diff
changeset
|
1807 |
*} |
30169 | 1808 |
|
46280 | 1809 |
|
50130 | 1810 |
section {* Algebraic reasoning via Gr\"obner bases *} |
1811 |
||
1812 |
text {* |
|
1813 |
\begin{matharray}{rcl} |
|
1814 |
@{method_def (HOL) "algebra"} & : & @{text method} \\ |
|
1815 |
@{attribute_def (HOL) algebra} & : & @{text attribute} \\ |
|
1816 |
\end{matharray} |
|
1817 |
||
1818 |
@{rail " |
|
1819 |
@@{method (HOL) algebra} |
|
1820 |
('add' ':' @{syntax thmrefs})? |
|
1821 |
('del' ':' @{syntax thmrefs})? |
|
1822 |
; |
|
1823 |
@@{attribute (HOL) algebra} (() | 'add' | 'del') |
|
1824 |
"} |
|
1825 |
||
1826 |
\begin{description} |
|
1827 |
||
1828 |
\item @{method (HOL) algebra} performs algebraic reasoning via |
|
1829 |
Gr\"obner bases, see also \cite{Chaieb-Wenzel:2007} and |
|
1830 |
\cite[\S3.2]{Chaieb-thesis}. The method handles deals with two main |
|
1831 |
classes of problems: |
|
1832 |
||
1833 |
\begin{enumerate} |
|
1834 |
||
1835 |
\item Universal problems over multivariate polynomials in a |
|
1836 |
(semi)-ring/field/idom; the capabilities of the method are augmented |
|
1837 |
according to properties of these structures. For this problem class |
|
1838 |
the method is only complete for algebraically closed fields, since |
|
1839 |
the underlying method is based on Hilbert's Nullstellensatz, where |
|
1840 |
the equivalence only holds for algebraically closed fields. |
|
1841 |
||
1842 |
The problems can contain equations @{text "p = 0"} or inequations |
|
1843 |
@{text "q \<noteq> 0"} anywhere within a universal problem statement. |
|
1844 |
||
1845 |
\item All-exists problems of the following restricted (but useful) |
|
1846 |
form: |
|
1847 |
||
1848 |
@{text [display] "\<forall>x\<^sub>1 \<dots> x\<^sub>n. |
|
1849 |
e\<^sub>1(x\<^sub>1, \<dots>, x\<^sub>n) = 0 \<and> \<dots> \<and> e\<^sub>m(x\<^sub>1, \<dots>, x\<^sub>n) = 0 \<longrightarrow> |
|
1850 |
(\<exists>y\<^sub>1 \<dots> y\<^sub>k. |
|
1851 |
p\<^sub>1\<^sub>1(x\<^sub>1, \<dots> ,x\<^sub>n) * y\<^sub>1 + \<dots> + p\<^sub>1\<^sub>k(x\<^sub>1, \<dots>, x\<^sub>n) * y\<^sub>k = 0 \<and> |
|
1852 |
\<dots> \<and> |
|
1853 |
p\<^sub>t\<^sub>1(x\<^sub>1, \<dots>, x\<^sub>n) * y\<^sub>1 + \<dots> + p\<^sub>t\<^sub>k(x\<^sub>1, \<dots>, x\<^sub>n) * y\<^sub>k = 0)"} |
|
1854 |
||
1855 |
Here @{text "e\<^sub>1, \<dots>, e\<^sub>n"} and the @{text "p\<^sub>i\<^sub>j"} are multivariate |
|
1856 |
polynomials only in the variables mentioned as arguments. |
|
1857 |
||
1858 |
\end{enumerate} |
|
1859 |
||
1860 |
The proof method is preceded by a simplification step, which may be |
|
1861 |
modified by using the form @{text "(algebra add: ths\<^sub>1 del: ths\<^sub>2)"}. |
|
1862 |
This acts like declarations for the Simplifier |
|
1863 |
(\secref{sec:simplifier}) on a private simpset for this tool. |
|
1864 |
||
1865 |
\item @{attribute algebra} (as attribute) manages the default |
|
1866 |
collection of pre-simplification rules of the above proof method. |
|
1867 |
||
1868 |
\end{description} |
|
1869 |
*} |
|
1870 |
||
1871 |
||
1872 |
subsubsection {* Example *} |
|
1873 |
||
1874 |
text {* The subsequent example is from geometry: collinearity is |
|
1875 |
invariant by rotation. *} |
|
1876 |
||
1877 |
type_synonym point = "int \<times> int" |
|
1878 |
||
1879 |
fun collinear :: "point \<Rightarrow> point \<Rightarrow> point \<Rightarrow> bool" where |
|
1880 |
"collinear (Ax, Ay) (Bx, By) (Cx, Cy) \<longleftrightarrow> |
|
1881 |
(Ax - Bx) * (By - Cy) = (Ay - By) * (Bx - Cx)" |
|
1882 |
||
1883 |
lemma collinear_inv_rotation: |
|
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52895
diff
changeset
|
1884 |
assumes "collinear (Ax, Ay) (Bx, By) (Cx, Cy)" and "c\<^sup>2 + s\<^sup>2 = 1" |
50130 | 1885 |
shows "collinear (Ax * c - Ay * s, Ay * c + Ax * s) |
1886 |
(Bx * c - By * s, By * c + Bx * s) (Cx * c - Cy * s, Cy * c + Cx * s)" |
|
1887 |
using assms by (algebra add: collinear.simps) |
|
1888 |
||
1889 |
text {* |
|
53982 | 1890 |
See also @{file "~~/src/HOL/ex/Groebner_Examples.thy"}. |
50130 | 1891 |
*} |
1892 |
||
1893 |
||
30171 | 1894 |
section {* Coherent Logic *} |
1895 |
||
1896 |
text {* |
|
1897 |
\begin{matharray}{rcl} |
|
1898 |
@{method_def (HOL) "coherent"} & : & @{text method} \\ |
|
1899 |
\end{matharray} |
|
1900 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1901 |
@{rail " |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1902 |
@@{method (HOL) coherent} @{syntax thmrefs}? |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1903 |
"} |
30171 | 1904 |
|
46280 | 1905 |
\begin{description} |
1906 |
||
1907 |
\item @{method (HOL) coherent} solves problems of \emph{Coherent |
|
1908 |
Logic} \cite{Bezem-Coquand:2005}, which covers applications in |
|
1909 |
confluence theory, lattice theory and projective geometry. See |
|
1910 |
@{file "~~/src/HOL/ex/Coherent.thy"} for some examples. |
|
1911 |
||
1912 |
\end{description} |
|
30171 | 1913 |
*} |
1914 |
||
1915 |
||
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1916 |
section {* Proving propositions *} |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1917 |
|
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1918 |
text {* |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1919 |
In addition to the standard proof methods, a number of diagnosis |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1920 |
tools search for proofs and provide an Isar proof snippet on success. |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1921 |
These tools are available via the following commands. |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1922 |
|
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1923 |
\begin{matharray}{rcl} |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1924 |
@{command_def (HOL) "solve_direct"}@{text "\<^sup>*"} & : & @{text "proof \<rightarrow>"} \\ |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1925 |
@{command_def (HOL) "try"}@{text "\<^sup>*"} & : & @{text "proof \<rightarrow>"} \\ |
46641 | 1926 |
@{command_def (HOL) "try0"}@{text "\<^sup>*"} & : & @{text "proof \<rightarrow>"} \\ |
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1927 |
@{command_def (HOL) "sledgehammer"}@{text "\<^sup>*"} & : & @{text "proof \<rightarrow>"} \\ |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1928 |
@{command_def (HOL) "sledgehammer_params"} & : & @{text "theory \<rightarrow> theory"} |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1929 |
\end{matharray} |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1930 |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1931 |
@{rail " |
43040 | 1932 |
@@{command (HOL) try} |
1933 |
; |
|
1934 |
||
46641 | 1935 |
@@{command (HOL) try0} ( ( ( 'simp' | 'intro' | 'elim' | 'dest' ) ':' @{syntax thmrefs} ) + ) ? |
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1936 |
@{syntax nat}? |
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1937 |
; |
43040 | 1938 |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1939 |
@@{command (HOL) sledgehammer} ( '[' args ']' )? facts? @{syntax nat}? |
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1940 |
; |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1941 |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1942 |
@@{command (HOL) sledgehammer_params} ( ( '[' args ']' ) ? ) |
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1943 |
; |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1944 |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1945 |
args: ( @{syntax name} '=' value + ',' ) |
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1946 |
; |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1947 |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
1948 |
facts: '(' ( ( ( ( 'add' | 'del' ) ':' ) ? @{syntax thmrefs} ) + ) ? ')' |
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1949 |
; |
43019
619f16bf2150
removed FIXME: "try_methods" doesn't take a clasimpmod, because it needs to generate Isar proof text in case of success and hence needs total control over its arguments
blanchet
parents:
43016
diff
changeset
|
1950 |
"} % FIXME check args "value" |
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1951 |
|
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1952 |
\begin{description} |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1953 |
|
46283 | 1954 |
\item @{command (HOL) "solve_direct"} checks whether the current |
1955 |
subgoals can be solved directly by an existing theorem. Duplicate |
|
1956 |
lemmas can be detected in this way. |
|
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1957 |
|
46641 | 1958 |
\item @{command (HOL) "try0"} attempts to prove a subgoal |
46283 | 1959 |
using a combination of standard proof methods (@{method auto}, |
1960 |
@{method simp}, @{method blast}, etc.). Additional facts supplied |
|
1961 |
via @{text "simp:"}, @{text "intro:"}, @{text "elim:"}, and @{text |
|
1962 |
"dest:"} are passed to the appropriate proof methods. |
|
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1963 |
|
43914
64819f353c53
updating documentation about quickcheck; adding information about try
bulwahn
parents:
43578
diff
changeset
|
1964 |
\item @{command (HOL) "try"} attempts to prove or disprove a subgoal |
46283 | 1965 |
using a combination of provers and disprovers (@{command (HOL) |
1966 |
"solve_direct"}, @{command (HOL) "quickcheck"}, @{command (HOL) |
|
46641 | 1967 |
"try0"}, @{command (HOL) "sledgehammer"}, @{command (HOL) |
46283 | 1968 |
"nitpick"}). |
43914
64819f353c53
updating documentation about quickcheck; adding information about try
bulwahn
parents:
43578
diff
changeset
|
1969 |
|
46283 | 1970 |
\item @{command (HOL) "sledgehammer"} attempts to prove a subgoal |
1971 |
using external automatic provers (resolution provers and SMT |
|
1972 |
solvers). See the Sledgehammer manual \cite{isabelle-sledgehammer} |
|
1973 |
for details. |
|
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1974 |
|
46283 | 1975 |
\item @{command (HOL) "sledgehammer_params"} changes @{command (HOL) |
1976 |
"sledgehammer"} configuration options persistently. |
|
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1977 |
|
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1978 |
\end{description} |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1979 |
*} |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1980 |
|
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1981 |
|
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
1982 |
section {* Checking and refuting propositions *} |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
1983 |
|
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
1984 |
text {* |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
1985 |
Identifying incorrect propositions usually involves evaluation of |
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1986 |
particular assignments and systematic counterexample search. This |
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
1987 |
is supported by the following commands. |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
1988 |
|
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
1989 |
\begin{matharray}{rcl} |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
1990 |
@{command_def (HOL) "value"}@{text "\<^sup>*"} & : & @{text "context \<rightarrow>"} \\ |
45409
5abb0e738b00
adding some documentation about the values command to the isar reference
bulwahn
parents:
45408
diff
changeset
|
1991 |
@{command_def (HOL) "values"}@{text "\<^sup>*"} & : & @{text "context \<rightarrow>"} \\ |
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
1992 |
@{command_def (HOL) "quickcheck"}@{text "\<^sup>*"} & : & @{text "proof \<rightarrow>"} \\ |
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1993 |
@{command_def (HOL) "nitpick"}@{text "\<^sup>*"} & : & @{text "proof \<rightarrow>"} \\ |
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
1994 |
@{command_def (HOL) "quickcheck_params"} & : & @{text "theory \<rightarrow> theory"} \\ |
45943
8c4a5e664fbc
adding documentation about the quickcheck_generator command in the IsarRef
bulwahn
parents:
45839
diff
changeset
|
1995 |
@{command_def (HOL) "nitpick_params"} & : & @{text "theory \<rightarrow> theory"} \\ |
46592
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
1996 |
@{command_def (HOL) "quickcheck_generator"} & : & @{text "theory \<rightarrow> theory"} \\ |
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
1997 |
@{command_def (HOL) "find_unused_assms"} & : & @{text "context \<rightarrow>"} |
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
1998 |
\end{matharray} |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
1999 |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2000 |
@{rail " |
46628 | 2001 |
@@{command (HOL) value} ( '[' @{syntax name} ']' )? modes? @{syntax term} |
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2002 |
; |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2003 |
|
45409
5abb0e738b00
adding some documentation about the values command to the isar reference
bulwahn
parents:
45408
diff
changeset
|
2004 |
@@{command (HOL) values} modes? @{syntax nat}? @{syntax term} |
5abb0e738b00
adding some documentation about the values command to the isar reference
bulwahn
parents:
45408
diff
changeset
|
2005 |
; |
5abb0e738b00
adding some documentation about the values command to the isar reference
bulwahn
parents:
45408
diff
changeset
|
2006 |
|
49993
80402e0e78e3
removed "refute" command from Isar manual, now that it has been moved outside "Main"
blanchet
parents:
49836
diff
changeset
|
2007 |
(@@{command (HOL) quickcheck} | @@{command (HOL) nitpick}) |
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2008 |
( '[' args ']' )? @{syntax nat}? |
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2009 |
; |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2010 |
|
49993
80402e0e78e3
removed "refute" command from Isar manual, now that it has been moved outside "Main"
blanchet
parents:
49836
diff
changeset
|
2011 |
(@@{command (HOL) quickcheck_params} | |
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2012 |
@@{command (HOL) nitpick_params}) ( '[' args ']' )? |
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2013 |
; |
46592
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2014 |
|
46628 | 2015 |
@@{command (HOL) quickcheck_generator} @{syntax nameref} \\ |
45943
8c4a5e664fbc
adding documentation about the quickcheck_generator command in the IsarRef
bulwahn
parents:
45839
diff
changeset
|
2016 |
'operations:' ( @{syntax term} +) |
8c4a5e664fbc
adding documentation about the quickcheck_generator command in the IsarRef
bulwahn
parents:
45839
diff
changeset
|
2017 |
; |
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2018 |
|
46628 | 2019 |
@@{command (HOL) find_unused_assms} @{syntax name}? |
46592
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2020 |
; |
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2021 |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2022 |
modes: '(' (@{syntax name} +) ')' |
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2023 |
; |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2024 |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2025 |
args: ( @{syntax name} '=' value + ',' ) |
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2026 |
; |
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2027 |
"} % FIXME check "value" |
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2028 |
|
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2029 |
\begin{description} |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2030 |
|
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2031 |
\item @{command (HOL) "value"}~@{text t} evaluates and prints a |
46283 | 2032 |
term; optionally @{text modes} can be specified, which are appended |
2033 |
to the current print mode; see \secref{sec:print-modes}. |
|
2034 |
Internally, the evaluation is performed by registered evaluators, |
|
2035 |
which are invoked sequentially until a result is returned. |
|
2036 |
Alternatively a specific evaluator can be selected using square |
|
2037 |
brackets; typical evaluators use the current set of code equations |
|
2038 |
to normalize and include @{text simp} for fully symbolic evaluation |
|
2039 |
using the simplifier, @{text nbe} for \emph{normalization by |
|
2040 |
evaluation} and \emph{code} for code generation in SML. |
|
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2041 |
|
46283 | 2042 |
\item @{command (HOL) "values"}~@{text t} enumerates a set |
2043 |
comprehension by evaluation and prints its values up to the given |
|
2044 |
number of solutions; optionally @{text modes} can be specified, |
|
2045 |
which are appended to the current print mode; see |
|
2046 |
\secref{sec:print-modes}. |
|
45409
5abb0e738b00
adding some documentation about the values command to the isar reference
bulwahn
parents:
45408
diff
changeset
|
2047 |
|
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2048 |
\item @{command (HOL) "quickcheck"} tests the current goal for |
46283 | 2049 |
counterexamples using a series of assignments for its free |
2050 |
variables; by default the first subgoal is tested, an other can be |
|
2051 |
selected explicitly using an optional goal index. Assignments can |
|
52895
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
2052 |
be chosen exhausting the search space up to a given size, or using a |
46283 | 2053 |
fixed number of random assignments in the search space, or exploring |
2054 |
the search space symbolically using narrowing. By default, |
|
2055 |
quickcheck uses exhaustive testing. A number of configuration |
|
2056 |
options are supported for @{command (HOL) "quickcheck"}, notably: |
|
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2057 |
|
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2058 |
\begin{description} |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2059 |
|
43914
64819f353c53
updating documentation about quickcheck; adding information about try
bulwahn
parents:
43578
diff
changeset
|
2060 |
\item[@{text tester}] specifies which testing approach to apply. |
46283 | 2061 |
There are three testers, @{text exhaustive}, @{text random}, and |
2062 |
@{text narrowing}. An unknown configuration option is treated as |
|
2063 |
an argument to tester, making @{text "tester ="} optional. When |
|
2064 |
multiple testers are given, these are applied in parallel. If no |
|
2065 |
tester is specified, quickcheck uses the testers that are set |
|
2066 |
active, i.e., configurations @{attribute |
|
2067 |
quickcheck_exhaustive_active}, @{attribute |
|
2068 |
quickcheck_random_active}, @{attribute |
|
2069 |
quickcheck_narrowing_active} are set to true. |
|
2070 |
||
40254 | 2071 |
\item[@{text size}] specifies the maximum size of the search space |
2072 |
for assignment values. |
|
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2073 |
|
45758
6210c350d88b
documenting the genuine_only option in quickcheck;
bulwahn
parents:
45701
diff
changeset
|
2074 |
\item[@{text genuine_only}] sets quickcheck only to return genuine |
46283 | 2075 |
counterexample, but not potentially spurious counterexamples due |
2076 |
to underspecified functions. |
|
46498
2754784e9153
adding documentation for abort_potential option in quickcheck
bulwahn
parents:
46494
diff
changeset
|
2077 |
|
2754784e9153
adding documentation for abort_potential option in quickcheck
bulwahn
parents:
46494
diff
changeset
|
2078 |
\item[@{text abort_potential}] sets quickcheck to abort once it |
2754784e9153
adding documentation for abort_potential option in quickcheck
bulwahn
parents:
46494
diff
changeset
|
2079 |
found a potentially spurious counterexample and to not continue |
2754784e9153
adding documentation for abort_potential option in quickcheck
bulwahn
parents:
46494
diff
changeset
|
2080 |
to search for a further genuine counterexample. |
2754784e9153
adding documentation for abort_potential option in quickcheck
bulwahn
parents:
46494
diff
changeset
|
2081 |
For this option to be effective, the @{text genuine_only} option |
2754784e9153
adding documentation for abort_potential option in quickcheck
bulwahn
parents:
46494
diff
changeset
|
2082 |
must be set to false. |
47859 | 2083 |
|
42092
f07b373f25d3
adding documentation about the eval option in quickcheck
bulwahn
parents:
41846
diff
changeset
|
2084 |
\item[@{text eval}] takes a term or a list of terms and evaluates |
46283 | 2085 |
these terms under the variable assignment found by quickcheck. |
48159 | 2086 |
This option is currently only supported by the default |
2087 |
(exhaustive) tester. |
|
42123 | 2088 |
|
40254 | 2089 |
\item[@{text iterations}] sets how many sets of assignments are |
2090 |
generated for each particular size. |
|
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2091 |
|
40254 | 2092 |
\item[@{text no_assms}] specifies whether assumptions in |
2093 |
structured proofs should be ignored. |
|
35331 | 2094 |
|
47349
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
46641
diff
changeset
|
2095 |
\item[@{text locale}] specifies how to process conjectures in |
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
46641
diff
changeset
|
2096 |
a locale context, i.e., they can be interpreted or expanded. |
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
46641
diff
changeset
|
2097 |
The option is a whitespace-separated list of the two words |
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
46641
diff
changeset
|
2098 |
@{text interpret} and @{text expand}. The list determines the |
47859 | 2099 |
order they are employed. The default setting is to first use |
47349
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
46641
diff
changeset
|
2100 |
interpretations and then test the expanded conjecture. |
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
46641
diff
changeset
|
2101 |
The option is only provided as attribute declaration, but not |
47859 | 2102 |
as parameter to the command. |
47349
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
46641
diff
changeset
|
2103 |
|
40254 | 2104 |
\item[@{text timeout}] sets the time limit in seconds. |
40245
59f011c1877a
updating documentation on quickcheck in the Isar reference
bulwahn
parents:
40171
diff
changeset
|
2105 |
|
40254 | 2106 |
\item[@{text default_type}] sets the type(s) generally used to |
2107 |
instantiate type variables. |
|
40245
59f011c1877a
updating documentation on quickcheck in the Isar reference
bulwahn
parents:
40171
diff
changeset
|
2108 |
|
40254 | 2109 |
\item[@{text report}] if set quickcheck reports how many tests |
2110 |
fulfilled the preconditions. |
|
40245
59f011c1877a
updating documentation on quickcheck in the Isar reference
bulwahn
parents:
40171
diff
changeset
|
2111 |
|
46592
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2112 |
\item[@{text use_subtype}] if set quickcheck automatically lifts |
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2113 |
conjectures to registered subtypes if possible, and tests the |
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2114 |
lifted conjecture. |
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2115 |
|
45766
46046d8e9659
updating documentation about quiet and verbose options in quickcheck
bulwahn
parents:
45758
diff
changeset
|
2116 |
\item[@{text quiet}] if set quickcheck does not output anything |
46046d8e9659
updating documentation about quiet and verbose options in quickcheck
bulwahn
parents:
45758
diff
changeset
|
2117 |
while testing. |
47859 | 2118 |
|
46283 | 2119 |
\item[@{text verbose}] if set quickcheck informs about the current |
2120 |
size and cardinality while testing. |
|
40245
59f011c1877a
updating documentation on quickcheck in the Isar reference
bulwahn
parents:
40171
diff
changeset
|
2121 |
|
40254 | 2122 |
\item[@{text expect}] can be used to check if the user's |
2123 |
expectation was met (@{text no_expectation}, @{text |
|
2124 |
no_counterexample}, or @{text counterexample}). |
|
40245
59f011c1877a
updating documentation on quickcheck in the Isar reference
bulwahn
parents:
40171
diff
changeset
|
2125 |
|
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2126 |
\end{description} |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2127 |
|
46283 | 2128 |
These option can be given within square brackets. |
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2129 |
|
46283 | 2130 |
\item @{command (HOL) "quickcheck_params"} changes @{command (HOL) |
2131 |
"quickcheck"} configuration options persistently. |
|
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
2132 |
|
45943
8c4a5e664fbc
adding documentation about the quickcheck_generator command in the IsarRef
bulwahn
parents:
45839
diff
changeset
|
2133 |
\item @{command (HOL) "quickcheck_generator"} creates random and |
46283 | 2134 |
exhaustive value generators for a given type and operations. It |
2135 |
generates values by using the operations as if they were |
|
2136 |
constructors of that type. |
|
45943
8c4a5e664fbc
adding documentation about the quickcheck_generator command in the IsarRef
bulwahn
parents:
45839
diff
changeset
|
2137 |
|
46283 | 2138 |
\item @{command (HOL) "nitpick"} tests the current goal for |
2139 |
counterexamples using a reduction to first-order relational |
|
2140 |
logic. See the Nitpick manual \cite{isabelle-nitpick} for details. |
|
42215
de9d43c427ae
document "nitpick(_params)", "refute(_params)", "try", "sledgehammer(_params)", and "solve_direct"
blanchet
parents:
42123
diff
changeset
|
2141 |
|
46283 | 2142 |
\item @{command (HOL) "nitpick_params"} changes @{command (HOL) |
2143 |
"nitpick"} configuration options persistently. |
|
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2144 |
|
46592
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2145 |
\item @{command (HOL) "find_unused_assms"} finds potentially superfluous |
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2146 |
assumptions in theorems using quickcheck. |
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2147 |
It takes the theory name to be checked for superfluous assumptions as |
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2148 |
optional argument. If not provided, it checks the current theory. |
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2149 |
Options to the internal quickcheck invocations can be changed with |
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2150 |
common configuration declarations. |
d5d49bd4a7b4
adding documentation about find_unused_assms command and use_subtype option in the IsarRef
bulwahn
parents:
46498
diff
changeset
|
2151 |
|
31912
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2152 |
\end{description} |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2153 |
*} |
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2154 |
|
f5bd306f5e9d
more friendly wrt. PGs interpretation of compound *); added dedicated section on value and quickcheck
haftmann
parents:
31254
diff
changeset
|
2155 |
|
28752 | 2156 |
section {* Unstructured case analysis and induction \label{sec:hol-induct-tac} *} |
26849 | 2157 |
|
2158 |
text {* |
|
27123
11fcdd5897dd
case_tac/induct_tac: use same declarations as cases/induct;
wenzelm
parents:
27103
diff
changeset
|
2159 |
The following tools of Isabelle/HOL support cases analysis and |
11fcdd5897dd
case_tac/induct_tac: use same declarations as cases/induct;
wenzelm
parents:
27103
diff
changeset
|
2160 |
induction in unstructured tactic scripts; see also |
11fcdd5897dd
case_tac/induct_tac: use same declarations as cases/induct;
wenzelm
parents:
27103
diff
changeset
|
2161 |
\secref{sec:cases-induct} for proper Isar versions of similar ideas. |
26849 | 2162 |
|
2163 |
\begin{matharray}{rcl} |
|
28761
9ec4482c9201
updated/refined types of Isar language elements, removed special LaTeX macros;
wenzelm
parents:
28760
diff
changeset
|
2164 |
@{method_def (HOL) case_tac}@{text "\<^sup>*"} & : & @{text method} \\ |
9ec4482c9201
updated/refined types of Isar language elements, removed special LaTeX macros;
wenzelm
parents:
28760
diff
changeset
|
2165 |
@{method_def (HOL) induct_tac}@{text "\<^sup>*"} & : & @{text method} \\ |
9ec4482c9201
updated/refined types of Isar language elements, removed special LaTeX macros;
wenzelm
parents:
28760
diff
changeset
|
2166 |
@{method_def (HOL) ind_cases}@{text "\<^sup>*"} & : & @{text method} \\ |
9ec4482c9201
updated/refined types of Isar language elements, removed special LaTeX macros;
wenzelm
parents:
28760
diff
changeset
|
2167 |
@{command_def (HOL) "inductive_cases"}@{text "\<^sup>*"} & : & @{text "local_theory \<rightarrow> local_theory"} \\ |
26849 | 2168 |
\end{matharray} |
2169 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2170 |
@{rail " |
42705 | 2171 |
@@{method (HOL) case_tac} @{syntax goal_spec}? @{syntax term} rule? |
26849 | 2172 |
; |
42705 | 2173 |
@@{method (HOL) induct_tac} @{syntax goal_spec}? (@{syntax insts} * @'and') rule? |
26849 | 2174 |
; |
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2175 |
@@{method (HOL) ind_cases} (@{syntax prop}+) (@'for' (@{syntax name}+))? |
26849 | 2176 |
; |
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2177 |
@@{command (HOL) inductive_cases} (@{syntax thmdecl}? (@{syntax prop}+) + @'and') |
26849 | 2178 |
; |
2179 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2180 |
rule: 'rule' ':' @{syntax thmref} |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2181 |
"} |
26849 | 2182 |
|
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
2183 |
\begin{description} |
26849 | 2184 |
|
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
2185 |
\item @{method (HOL) case_tac} and @{method (HOL) induct_tac} admit |
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
2186 |
to reason about inductive types. Rules are selected according to |
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
2187 |
the declarations by the @{attribute cases} and @{attribute induct} |
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
2188 |
attributes, cf.\ \secref{sec:cases-induct}. The @{command (HOL) |
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
2189 |
datatype} package already takes care of this. |
27123
11fcdd5897dd
case_tac/induct_tac: use same declarations as cases/induct;
wenzelm
parents:
27103
diff
changeset
|
2190 |
|
11fcdd5897dd
case_tac/induct_tac: use same declarations as cases/induct;
wenzelm
parents:
27103
diff
changeset
|
2191 |
These unstructured tactics feature both goal addressing and dynamic |
26849 | 2192 |
instantiation. Note that named rule cases are \emph{not} provided |
27123
11fcdd5897dd
case_tac/induct_tac: use same declarations as cases/induct;
wenzelm
parents:
27103
diff
changeset
|
2193 |
as would be by the proper @{method cases} and @{method induct} proof |
11fcdd5897dd
case_tac/induct_tac: use same declarations as cases/induct;
wenzelm
parents:
27103
diff
changeset
|
2194 |
methods (see \secref{sec:cases-induct}). Unlike the @{method |
11fcdd5897dd
case_tac/induct_tac: use same declarations as cases/induct;
wenzelm
parents:
27103
diff
changeset
|
2195 |
induct} method, @{method induct_tac} does not handle structured rule |
11fcdd5897dd
case_tac/induct_tac: use same declarations as cases/induct;
wenzelm
parents:
27103
diff
changeset
|
2196 |
statements, only the compact object-logic conclusion of the subgoal |
11fcdd5897dd
case_tac/induct_tac: use same declarations as cases/induct;
wenzelm
parents:
27103
diff
changeset
|
2197 |
being addressed. |
42123 | 2198 |
|
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
2199 |
\item @{method (HOL) ind_cases} and @{command (HOL) |
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
2200 |
"inductive_cases"} provide an interface to the internal @{ML_text |
26860 | 2201 |
mk_cases} operation. Rules are simplified in an unrestricted |
2202 |
forward manner. |
|
26849 | 2203 |
|
2204 |
While @{method (HOL) ind_cases} is a proof method to apply the |
|
2205 |
result immediately as elimination rules, @{command (HOL) |
|
2206 |
"inductive_cases"} provides case split theorems at the theory level |
|
2207 |
for later use. The @{keyword "for"} argument of the @{method (HOL) |
|
2208 |
ind_cases} method allows to specify a list of variables that should |
|
2209 |
be generalized before applying the resulting rule. |
|
2210 |
||
28760
cbc435f7b16b
unified use of declaration environment with IsarImplementation;
wenzelm
parents:
28752
diff
changeset
|
2211 |
\end{description} |
26849 | 2212 |
*} |
2213 |
||
2214 |
||
50109 | 2215 |
chapter {* Executable code *} |
26849 | 2216 |
|
42627
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2217 |
text {* For validation purposes, it is often useful to \emph{execute} |
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2218 |
specifications. In principle, execution could be simulated by |
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2219 |
Isabelle's inference kernel, i.e. by a combination of resolution and |
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2220 |
simplification. Unfortunately, this approach is rather inefficient. |
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2221 |
A more efficient way of executing specifications is to translate |
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2222 |
them into a functional programming language such as ML. |
26849 | 2223 |
|
45192 | 2224 |
Isabelle provides a generic framework to support code generation |
42627
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2225 |
from executable specifications. Isabelle/HOL instantiates these |
45192 | 2226 |
mechanisms in a way that is amenable to end-user applications. Code |
2227 |
can be generated for functional programs (including overloading |
|
2228 |
using type classes) targeting SML \cite{SML}, OCaml \cite{OCaml}, |
|
2229 |
Haskell \cite{haskell-revised-report} and Scala |
|
42627
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2230 |
\cite{scala-overview-tech-report}. Conceptually, code generation is |
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2231 |
split up in three steps: \emph{selection} of code theorems, |
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2232 |
\emph{translation} into an abstract executable view and |
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2233 |
\emph{serialization} to a specific \emph{target language}. |
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2234 |
Inductive specifications can be executed using the predicate |
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2235 |
compiler which operates within HOL. See \cite{isabelle-codegen} for |
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2236 |
an introduction. |
37422 | 2237 |
|
2238 |
\begin{matharray}{rcl} |
|
2239 |
@{command_def (HOL) "export_code"}@{text "\<^sup>*"} & : & @{text "context \<rightarrow>"} \\ |
|
2240 |
@{attribute_def (HOL) code} & : & @{text attribute} \\ |
|
2241 |
@{command_def (HOL) "code_abort"} & : & @{text "theory \<rightarrow> theory"} \\ |
|
2242 |
@{command_def (HOL) "code_datatype"} & : & @{text "theory \<rightarrow> theory"} \\ |
|
2243 |
@{command_def (HOL) "print_codesetup"}@{text "\<^sup>*"} & : & @{text "context \<rightarrow>"} \\ |
|
45232
eb56e1774c26
updating documentation: code_inline -> code_unfold; added documentation about attribute code_unfold_post
bulwahn
parents:
45192
diff
changeset
|
2244 |
@{attribute_def (HOL) code_unfold} & : & @{text attribute} \\ |
37422 | 2245 |
@{attribute_def (HOL) code_post} & : & @{text attribute} \\ |
46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
45944
diff
changeset
|
2246 |
@{attribute_def (HOL) code_abbrev} & : & @{text attribute} \\ |
37422 | 2247 |
@{command_def (HOL) "print_codeproc"}@{text "\<^sup>*"} & : & @{text "context \<rightarrow>"} \\ |
2248 |
@{command_def (HOL) "code_thms"}@{text "\<^sup>*"} & : & @{text "context \<rightarrow>"} \\ |
|
2249 |
@{command_def (HOL) "code_deps"}@{text "\<^sup>*"} & : & @{text "context \<rightarrow>"} \\ |
|
52378
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2250 |
@{command_def (HOL) "code_reserved"} & : & @{text "theory \<rightarrow> theory"} \\ |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2251 |
@{command_def (HOL) "code_printing"} & : & @{text "theory \<rightarrow> theory"} \\ |
37422 | 2252 |
@{command_def (HOL) "code_const"} & : & @{text "theory \<rightarrow> theory"} \\ |
2253 |
@{command_def (HOL) "code_type"} & : & @{text "theory \<rightarrow> theory"} \\ |
|
2254 |
@{command_def (HOL) "code_class"} & : & @{text "theory \<rightarrow> theory"} \\ |
|
2255 |
@{command_def (HOL) "code_instance"} & : & @{text "theory \<rightarrow> theory"} \\ |
|
52378
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2256 |
@{command_def (HOL) "code_include"} & : & @{text "theory \<rightarrow> theory"} \\ |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2257 |
@{command_def (HOL) "code_identifier"} & : & @{text "theory \<rightarrow> theory"} \\ |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2258 |
@{command_def (HOL) "code_modulename"} & : & @{text "theory \<rightarrow> theory"} \\ |
37422 | 2259 |
@{command_def (HOL) "code_monad"} & : & @{text "theory \<rightarrow> theory"} \\ |
45408
7156f63ce3c2
adding a minimal documentation about the code_pred command to the isar reference
bulwahn
parents:
45232
diff
changeset
|
2260 |
@{command_def (HOL) "code_reflect"} & : & @{text "theory \<rightarrow> theory"} \\ |
7156f63ce3c2
adding a minimal documentation about the code_pred command to the isar reference
bulwahn
parents:
45232
diff
changeset
|
2261 |
@{command_def (HOL) "code_pred"} & : & @{text "theory \<rightarrow> proof(prove)"} |
37422 | 2262 |
\end{matharray} |
2263 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2264 |
@{rail " |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2265 |
@@{command (HOL) export_code} ( constexpr + ) \\ |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2266 |
( ( @'in' target ( @'module_name' @{syntax string} ) ? \\ |
52435
6646bb548c6b
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents:
52378
diff
changeset
|
2267 |
( @'file' @{syntax string} ) ? ( '(' args ')' ) ?) + ) ? |
37422 | 2268 |
; |
2269 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2270 |
const: @{syntax term} |
37422 | 2271 |
; |
2272 |
||
40711
81bc73585eec
globbing constant expressions use more idiomatic underscore rather than star
haftmann
parents:
40709
diff
changeset
|
2273 |
constexpr: ( const | 'name._' | '_' ) |
37422 | 2274 |
; |
2275 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2276 |
typeconstructor: @{syntax nameref} |
37422 | 2277 |
; |
2278 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2279 |
class: @{syntax nameref} |
37422 | 2280 |
; |
2281 |
||
52378
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2282 |
target: 'SML' | 'OCaml' | 'Haskell' | 'Scala' | 'Eval' |
37422 | 2283 |
; |
2284 |
||
52637
1501ebe39711
attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents:
52476
diff
changeset
|
2285 |
@@{attribute (HOL) code} ( 'del' | 'equation' | 'abstype' | 'abstract' )? |
37422 | 2286 |
; |
2287 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2288 |
@@{command (HOL) code_abort} ( const + ) |
37422 | 2289 |
; |
2290 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2291 |
@@{command (HOL) code_datatype} ( const + ) |
37422 | 2292 |
; |
2293 |
||
45232
eb56e1774c26
updating documentation: code_inline -> code_unfold; added documentation about attribute code_unfold_post
bulwahn
parents:
45192
diff
changeset
|
2294 |
@@{attribute (HOL) code_unfold} ( 'del' ) ? |
37422 | 2295 |
; |
2296 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2297 |
@@{attribute (HOL) code_post} ( 'del' ) ? |
37422 | 2298 |
; |
2299 |
||
46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
45944
diff
changeset
|
2300 |
@@{attribute (HOL) code_abbrev} |
45232
eb56e1774c26
updating documentation: code_inline -> code_unfold; added documentation about attribute code_unfold_post
bulwahn
parents:
45192
diff
changeset
|
2301 |
; |
eb56e1774c26
updating documentation: code_inline -> code_unfold; added documentation about attribute code_unfold_post
bulwahn
parents:
45192
diff
changeset
|
2302 |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2303 |
@@{command (HOL) code_thms} ( constexpr + ) ? |
37422 | 2304 |
; |
2305 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2306 |
@@{command (HOL) code_deps} ( constexpr + ) ? |
37422 | 2307 |
; |
2308 |
||
52378
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2309 |
@@{command (HOL) code_reserved} target ( @{syntax string} + ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2310 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2311 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2312 |
symbol_const: ( @'constant' const ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2313 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2314 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2315 |
symbol_typeconstructor: ( @'type_constructor' typeconstructor ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2316 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2317 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2318 |
symbol_class: ( @'type_class' class ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2319 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2320 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2321 |
symbol_class_relation: ( @'class_relation' class ( '<' | '\<subseteq>' ) class ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2322 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2323 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2324 |
symbol_class_instance: ( @'class_instance' typeconstructor @'::' class ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2325 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2326 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2327 |
symbol_module: ( @'code_module' name ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2328 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2329 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2330 |
syntax: @{syntax string} | ( @'infix' | @'infixl' | @'infixr' ) @{syntax nat} @{syntax string} |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2331 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2332 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2333 |
printing_const: symbol_const ( '\<rightharpoonup>' | '=>' ) \\ |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2334 |
( '(' target ')' syntax ? + @'and' ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2335 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2336 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2337 |
printing_typeconstructor: symbol_typeconstructor ( '\<rightharpoonup>' | '=>' ) \\ |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2338 |
( '(' target ')' syntax ? + @'and' ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2339 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2340 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2341 |
printing_class: symbol_class ( '\<rightharpoonup>' | '=>' ) \\ |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2342 |
( '(' target ')' @{syntax string} ? + @'and' ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2343 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2344 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2345 |
printing_class_relation: symbol_class_relation ( '\<rightharpoonup>' | '=>' ) \\ |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2346 |
( '(' target ')' @{syntax string} ? + @'and' ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2347 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2348 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2349 |
printing_class_instance: symbol_class_instance ( '\<rightharpoonup>' | '=>' ) \\ |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2350 |
( '(' target ')' '-' ? + @'and' ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2351 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2352 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2353 |
printing_module: symbol_module ( '\<rightharpoonup>' | '=>' ) \\ |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2354 |
( '(' target ')' ( @{syntax string} ( @'attach' ( const + ) ) ? ) ? + @'and' ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2355 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2356 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2357 |
@@{command (HOL) code_printing} ( ( printing_const | printing_typeconstructor |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2358 |
| printing_class | printing_class_relation | printing_class_instance |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2359 |
| printing_module ) + '|' ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2360 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2361 |
|
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2362 |
@@{command (HOL) code_const} (const + @'and') \\ |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2363 |
( ( '(' target ( syntax ? + @'and' ) ')' ) + ) |
37422 | 2364 |
; |
2365 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2366 |
@@{command (HOL) code_type} (typeconstructor + @'and') \\ |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2367 |
( ( '(' target ( syntax ? + @'and' ) ')' ) + ) |
37422 | 2368 |
; |
2369 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2370 |
@@{command (HOL) code_class} (class + @'and') \\ |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2371 |
( ( '(' target \\ ( @{syntax string} ? + @'and' ) ')' ) + ) |
37422 | 2372 |
; |
2373 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2374 |
@@{command (HOL) code_instance} (( typeconstructor '::' class ) + @'and') \\ |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2375 |
( ( '(' target ( '-' ? + @'and' ) ')' ) + ) |
37422 | 2376 |
; |
2377 |
||
52378
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2378 |
@@{command (HOL) code_include} target ( @{syntax string} ( @{syntax string} | '-') ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2379 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2380 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2381 |
@@{command (HOL) code_identifier} ( ( symbol_const | symbol_typeconstructor |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2382 |
| symbol_class | symbol_class_relation | symbol_class_instance |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2383 |
| symbol_module ) ( '\<rightharpoonup>' | '=>' ) \\ |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2384 |
( '(' target ')' @{syntax string} ? + @'and' ) + '|' ) |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2385 |
; |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2386 |
|
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2387 |
@@{command (HOL) code_modulename} target ( ( @{syntax string} @{syntax string} ) + ) |
37422 | 2388 |
; |
2389 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2390 |
@@{command (HOL) code_monad} const const target |
37422 | 2391 |
; |
2392 |
||
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2393 |
@@{command (HOL) code_reflect} @{syntax string} \\ |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2394 |
( @'datatypes' ( @{syntax string} '=' ( '_' | ( @{syntax string} + '|' ) + @'and' ) ) ) ? \\ |
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2395 |
( @'functions' ( @{syntax string} + ) ) ? ( @'file' @{syntax string} ) ? |
37422 | 2396 |
; |
2397 |
||
45408
7156f63ce3c2
adding a minimal documentation about the code_pred command to the isar reference
bulwahn
parents:
45232
diff
changeset
|
2398 |
@@{command (HOL) code_pred} \\( '(' @'modes' ':' modedecl ')')? \\ const |
7156f63ce3c2
adding a minimal documentation about the code_pred command to the isar reference
bulwahn
parents:
45232
diff
changeset
|
2399 |
; |
7156f63ce3c2
adding a minimal documentation about the code_pred command to the isar reference
bulwahn
parents:
45232
diff
changeset
|
2400 |
|
7156f63ce3c2
adding a minimal documentation about the code_pred command to the isar reference
bulwahn
parents:
45232
diff
changeset
|
2401 |
modedecl: (modes | ((const ':' modes) \\ |
7156f63ce3c2
adding a minimal documentation about the code_pred command to the isar reference
bulwahn
parents:
45232
diff
changeset
|
2402 |
(@'and' ((const ':' modes @'and') +))?)) |
7156f63ce3c2
adding a minimal documentation about the code_pred command to the isar reference
bulwahn
parents:
45232
diff
changeset
|
2403 |
; |
47859 | 2404 |
|
45408
7156f63ce3c2
adding a minimal documentation about the code_pred command to the isar reference
bulwahn
parents:
45232
diff
changeset
|
2405 |
modes: mode @'as' const |
42596
6c621a9d612a
modernized rail diagrams using @{rail} antiquotation;
wenzelm
parents:
42215
diff
changeset
|
2406 |
"} |
37422 | 2407 |
|
2408 |
\begin{description} |
|
2409 |
||
2410 |
\item @{command (HOL) "export_code"} generates code for a given list |
|
39608 | 2411 |
of constants in the specified target language(s). If no |
2412 |
serialization instruction is given, only abstract code is generated |
|
2413 |
internally. |
|
37422 | 2414 |
|
2415 |
Constants may be specified by giving them literally, referring to |
|
52895
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
2416 |
all executable constants within a certain theory by giving @{text |
37422 | 2417 |
"name.*"}, or referring to \emph{all} executable constants currently |
2418 |
available by giving @{text "*"}. |
|
2419 |
||
2420 |
By default, for each involved theory one corresponding name space |
|
52895
a806aa7a5370
some documentation for adhoc overloading;
Christian Sternagel
parents:
52637
diff
changeset
|
2421 |
module is generated. Alternatively, a module name may be specified |
37422 | 2422 |
after the @{keyword "module_name"} keyword; then \emph{all} code is |
2423 |
placed in this module. |
|
2424 |
||
39608 | 2425 |
For \emph{SML}, \emph{OCaml} and \emph{Scala} the file specification |
2426 |
refers to a single file; for \emph{Haskell}, it refers to a whole |
|
2427 |
directory, where code is generated in multiple files reflecting the |
|
2428 |
module hierarchy. Omitting the file specification denotes standard |
|
37749 | 2429 |
output. |
37422 | 2430 |
|
2431 |
Serializers take an optional list of arguments in parentheses. For |
|
2432 |
\emph{SML} and \emph{OCaml}, ``@{text no_signatures}`` omits |
|
2433 |
explicit module signatures. |
|
42123 | 2434 |
|
39608 | 2435 |
For \emph{Haskell} a module name prefix may be given using the |
2436 |
``@{text "root:"}'' argument; ``@{text string_classes}'' adds a |
|
2437 |
``@{verbatim "deriving (Read, Show)"}'' clause to each appropriate |
|
2438 |
datatype declaration. |
|
37422 | 2439 |
|
52637
1501ebe39711
attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents:
52476
diff
changeset
|
2440 |
\item @{attribute (HOL) code} declare code equations for code |
1501ebe39711
attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents:
52476
diff
changeset
|
2441 |
generation. Variant @{text "code equation"} declares a conventional |
1501ebe39711
attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents:
52476
diff
changeset
|
2442 |
equation as code equation. Variants @{text "code abstype"} and |
38462
34d3de1254cd
formally document `code abstype` and `code abstract` attributes
haftmann
parents:
37820
diff
changeset
|
2443 |
@{text "code abstract"} declare abstract datatype certificates or |
34d3de1254cd
formally document `code abstype` and `code abstract` attributes
haftmann
parents:
37820
diff
changeset
|
2444 |
code equations on abstract datatype representations respectively. |
52637
1501ebe39711
attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents:
52476
diff
changeset
|
2445 |
Vanilla @{text "code"} falls back to @{text "code equation"} |
1501ebe39711
attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents:
52476
diff
changeset
|
2446 |
or @{text "code abstype"} depending on the syntactic shape |
1501ebe39711
attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents:
52476
diff
changeset
|
2447 |
of the underlying equation. Variant @{text "code del"} |
1501ebe39711
attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents:
52476
diff
changeset
|
2448 |
deselects a code equation for code generation. |
1501ebe39711
attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents:
52476
diff
changeset
|
2449 |
|
1501ebe39711
attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents:
52476
diff
changeset
|
2450 |
Usually packages introducing code equations provide a reasonable |
1501ebe39711
attribute "code" declares concrete and abstract code equations uniformly; added explicit "code equation" instead
haftmann
parents:
52476
diff
changeset
|
2451 |
default setup for selection. |
37422 | 2452 |
|
2453 |
\item @{command (HOL) "code_abort"} declares constants which are not |
|
39608 | 2454 |
required to have a definition by means of code equations; if needed |
2455 |
these are implemented by program abort instead. |
|
37422 | 2456 |
|
2457 |
\item @{command (HOL) "code_datatype"} specifies a constructor set |
|
2458 |
for a logical type. |
|
2459 |
||
2460 |
\item @{command (HOL) "print_codesetup"} gives an overview on |
|
2461 |
selected code equations and code generator datatypes. |
|
2462 |
||
45232
eb56e1774c26
updating documentation: code_inline -> code_unfold; added documentation about attribute code_unfold_post
bulwahn
parents:
45192
diff
changeset
|
2463 |
\item @{attribute (HOL) code_unfold} declares (or with option |
46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
45944
diff
changeset
|
2464 |
``@{text "del"}'' removes) theorems which during preprocessing |
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
45944
diff
changeset
|
2465 |
are applied as rewrite rules to any code equation or evaluation |
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
45944
diff
changeset
|
2466 |
input. |
37422 | 2467 |
|
39608 | 2468 |
\item @{attribute (HOL) code_post} declares (or with option ``@{text |
2469 |
"del"}'' removes) theorems which are applied as rewrite rules to any |
|
2470 |
result of an evaluation. |
|
37422 | 2471 |
|
46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
45944
diff
changeset
|
2472 |
\item @{attribute (HOL) code_abbrev} declares equations which are |
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
45944
diff
changeset
|
2473 |
applied as rewrite rules to any result of an evaluation and |
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
45944
diff
changeset
|
2474 |
symmetrically during preprocessing to any code equation or evaluation |
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
45944
diff
changeset
|
2475 |
input. |
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
45944
diff
changeset
|
2476 |
|
39608 | 2477 |
\item @{command (HOL) "print_codeproc"} prints the setup of the code |
2478 |
generator preprocessor. |
|
37422 | 2479 |
|
2480 |
\item @{command (HOL) "code_thms"} prints a list of theorems |
|
2481 |
representing the corresponding program containing all given |
|
2482 |
constants after preprocessing. |
|
2483 |
||
2484 |
\item @{command (HOL) "code_deps"} visualizes dependencies of |
|
2485 |
theorems representing the corresponding program containing all given |
|
2486 |
constants after preprocessing. |
|
2487 |
||
2488 |
\item @{command (HOL) "code_reserved"} declares a list of names as |
|
2489 |
reserved for a given target, preventing it to be shadowed by any |
|
2490 |
generated code. |
|
2491 |
||
52378
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2492 |
\item @{command (HOL) "code_printing"} associates a series of symbols |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2493 |
(constants, type constructors, classes, class relations, instances, |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2494 |
module names) with target-specific serializations; omitting a serialization |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2495 |
deletes an existing serialization. Legacy variants of this are |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2496 |
@{command (HOL) "code_const"}, @{command (HOL) "code_type"}, |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2497 |
@{command (HOL) "code_class"}, @{command (HOL) "code_instance"}, |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2498 |
@{command (HOL) "code_include"}. |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2499 |
|
37422 | 2500 |
\item @{command (HOL) "code_monad"} provides an auxiliary mechanism |
2501 |
to generate monadic code for Haskell. |
|
2502 |
||
52378
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2503 |
\item @{command (HOL) "code_identifier"} associates a a series of symbols |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2504 |
(constants, type constructors, classes, class relations, instances, |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2505 |
module names) with target-specific hints how these symbols shall be named. |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2506 |
\emph{Warning:} These hints are still subject to name disambiguation. |
08dbf9ff2140
documentation on code_printing and code_identifier
haftmann
parents:
50879
diff
changeset
|
2507 |
@{command (HOL) "code_modulename"} is a legacy variant for |
52476 | 2508 |
@{command (HOL) "code_identifier"} on module names. It is at the discretion |
2509 |
of the user to ensure that name prefixes of identifiers in compound |
|
2510 |
statements like type classes or datatypes are still the same. |
|
37422 | 2511 |
|
39608 | 2512 |
\item @{command (HOL) "code_reflect"} without a ``@{text "file"}'' |
2513 |
argument compiles code into the system runtime environment and |
|
2514 |
modifies the code generator setup that future invocations of system |
|
2515 |
runtime code generation referring to one of the ``@{text |
|
47859 | 2516 |
"datatypes"}'' or ``@{text "functions"}'' entities use these |
2517 |
precompiled entities. With a ``@{text "file"}'' argument, the |
|
2518 |
corresponding code is generated into that specified file without |
|
2519 |
modifying the code generator setup. |
|
2520 |
||
2521 |
\item @{command (HOL) "code_pred"} creates code equations for a |
|
2522 |
predicate given a set of introduction rules. Optional mode |
|
2523 |
annotations determine which arguments are supposed to be input or |
|
2524 |
output. If alternative introduction rules are declared, one must |
|
2525 |
prove a corresponding elimination rule. |
|
45408
7156f63ce3c2
adding a minimal documentation about the code_pred command to the isar reference
bulwahn
parents:
45232
diff
changeset
|
2526 |
|
37422 | 2527 |
\end{description} |
42627
8749742785b8
moved material about old codegen to isar-ref manual;
wenzelm
parents:
42626
diff
changeset
|
2528 |
*} |
37422 | 2529 |
|
26840 | 2530 |
end |