18537
|
1 |
%
|
|
2 |
\begin{isabellebody}%
|
|
3 |
\def\isabellecontext{logic}%
|
|
4 |
%
|
|
5 |
\isadelimtheory
|
|
6 |
\isanewline
|
|
7 |
\isanewline
|
|
8 |
\isanewline
|
|
9 |
%
|
|
10 |
\endisadelimtheory
|
|
11 |
%
|
|
12 |
\isatagtheory
|
|
13 |
\isacommand{theory}\isamarkupfalse%
|
|
14 |
\ logic\ \isakeyword{imports}\ base\ \isakeyword{begin}%
|
|
15 |
\endisatagtheory
|
|
16 |
{\isafoldtheory}%
|
|
17 |
%
|
|
18 |
\isadelimtheory
|
|
19 |
%
|
|
20 |
\endisadelimtheory
|
|
21 |
%
|
20471
|
22 |
\isamarkupchapter{Primitive logic \label{ch:logic}%
|
18537
|
23 |
}
|
|
24 |
\isamarkuptrue%
|
|
25 |
%
|
20481
|
26 |
\begin{isamarkuptext}%
|
|
27 |
The logical foundations of Isabelle/Isar are that of the Pure logic,
|
|
28 |
which has been introduced as a natural-deduction framework in
|
20493
|
29 |
\cite{paulson700}. This is essentially the same logic as ``\isa{{\isasymlambda}HOL}'' in the more abstract setting of Pure Type Systems (PTS)
|
20481
|
30 |
\cite{Barendregt-Geuvers:2001}, although there are some key
|
20491
|
31 |
differences in the specific treatment of simple types in
|
|
32 |
Isabelle/Pure.
|
20481
|
33 |
|
|
34 |
Following type-theoretic parlance, the Pure logic consists of three
|
20543
|
35 |
levels of \isa{{\isasymlambda}}-calculus with corresponding arrows, \isa{{\isasymRightarrow}} for syntactic function space (terms depending on terms), \isa{{\isasymAnd}} for universal quantification (proofs depending on terms), and
|
20481
|
36 |
\isa{{\isasymLongrightarrow}} for implication (proofs depending on proofs).
|
|
37 |
|
20537
|
38 |
Derivations are relative to a logical theory, which declares type
|
|
39 |
constructors, constants, and axioms. Theory declarations support
|
|
40 |
schematic polymorphism, which is strictly speaking outside the
|
|
41 |
logic.\footnote{This is the deeper logical reason, why the theory
|
|
42 |
context \isa{{\isasymTheta}} is separate from the proof context \isa{{\isasymGamma}}
|
|
43 |
of the core calculus.}%
|
20481
|
44 |
\end{isamarkuptext}%
|
|
45 |
\isamarkuptrue%
|
|
46 |
%
|
20451
|
47 |
\isamarkupsection{Types \label{sec:types}%
|
18537
|
48 |
}
|
|
49 |
\isamarkuptrue%
|
|
50 |
%
|
|
51 |
\begin{isamarkuptext}%
|
20481
|
52 |
The language of types is an uninterpreted order-sorted first-order
|
|
53 |
algebra; types are qualified by ordered type classes.
|
20451
|
54 |
|
20481
|
55 |
\medskip A \emph{type class} is an abstract syntactic entity
|
|
56 |
declared in the theory context. The \emph{subclass relation} \isa{c\isactrlisub {\isadigit{1}}\ {\isasymsubseteq}\ c\isactrlisub {\isadigit{2}}} is specified by stating an acyclic
|
20491
|
57 |
generating relation; the transitive closure is maintained
|
|
58 |
internally. The resulting relation is an ordering: reflexive,
|
|
59 |
transitive, and antisymmetric.
|
20451
|
60 |
|
20537
|
61 |
A \emph{sort} is a list of type classes written as \isa{s\ {\isacharequal}\ {\isacharbraceleft}c\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ c\isactrlisub m{\isacharbraceright}}, which represents symbolic
|
20481
|
62 |
intersection. Notationally, the curly braces are omitted for
|
|
63 |
singleton intersections, i.e.\ any class \isa{c} may be read as
|
|
64 |
a sort \isa{{\isacharbraceleft}c{\isacharbraceright}}. The ordering on type classes is extended to
|
20491
|
65 |
sorts according to the meaning of intersections: \isa{{\isacharbraceleft}c\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}\ c\isactrlisub m{\isacharbraceright}\ {\isasymsubseteq}\ {\isacharbraceleft}d\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ d\isactrlisub n{\isacharbraceright}} iff
|
|
66 |
\isa{{\isasymforall}j{\isachardot}\ {\isasymexists}i{\isachardot}\ c\isactrlisub i\ {\isasymsubseteq}\ d\isactrlisub j}. The empty intersection
|
|
67 |
\isa{{\isacharbraceleft}{\isacharbraceright}} refers to the universal sort, which is the largest
|
|
68 |
element wrt.\ the sort order. The intersections of all (finitely
|
|
69 |
many) classes declared in the current theory are the minimal
|
|
70 |
elements wrt.\ the sort order.
|
20451
|
71 |
|
20491
|
72 |
\medskip A \emph{fixed type variable} is a pair of a basic name
|
20537
|
73 |
(starting with a \isa{{\isacharprime}} character) and a sort constraint, e.g.\
|
|
74 |
\isa{{\isacharparenleft}{\isacharprime}a{\isacharcomma}\ s{\isacharparenright}} which is usually printed as \isa{{\isasymalpha}\isactrlisub s}.
|
|
75 |
A \emph{schematic type variable} is a pair of an indexname and a
|
|
76 |
sort constraint, e.g.\ \isa{{\isacharparenleft}{\isacharparenleft}{\isacharprime}a{\isacharcomma}\ {\isadigit{0}}{\isacharparenright}{\isacharcomma}\ s{\isacharparenright}} which is usually
|
|
77 |
printed as \isa{{\isacharquery}{\isasymalpha}\isactrlisub s}.
|
20481
|
78 |
|
|
79 |
Note that \emph{all} syntactic components contribute to the identity
|
20493
|
80 |
of type variables, including the sort constraint. The core logic
|
|
81 |
handles type variables with the same name but different sorts as
|
|
82 |
different, although some outer layers of the system make it hard to
|
|
83 |
produce anything like this.
|
18537
|
84 |
|
20493
|
85 |
A \emph{type constructor} \isa{{\isasymkappa}} is a \isa{k}-ary operator
|
|
86 |
on types declared in the theory. Type constructor application is
|
20537
|
87 |
written postfix as \isa{{\isacharparenleft}{\isasymalpha}\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ {\isasymalpha}\isactrlisub k{\isacharparenright}{\isasymkappa}}. For
|
|
88 |
\isa{k\ {\isacharequal}\ {\isadigit{0}}} the argument tuple is omitted, e.g.\ \isa{prop}
|
|
89 |
instead of \isa{{\isacharparenleft}{\isacharparenright}prop}. For \isa{k\ {\isacharequal}\ {\isadigit{1}}} the parentheses
|
|
90 |
are omitted, e.g.\ \isa{{\isasymalpha}\ list} instead of \isa{{\isacharparenleft}{\isasymalpha}{\isacharparenright}list}.
|
|
91 |
Further notation is provided for specific constructors, notably the
|
|
92 |
right-associative infix \isa{{\isasymalpha}\ {\isasymRightarrow}\ {\isasymbeta}} instead of \isa{{\isacharparenleft}{\isasymalpha}{\isacharcomma}\ {\isasymbeta}{\isacharparenright}fun}.
|
20481
|
93 |
|
20537
|
94 |
A \emph{type} is defined inductively over type variables and type
|
20543
|
95 |
constructors as follows: \isa{{\isasymtau}\ {\isacharequal}\ {\isasymalpha}\isactrlisub s\ {\isacharbar}\ {\isacharquery}{\isasymalpha}\isactrlisub s\ {\isacharbar}\ {\isacharparenleft}{\isasymtau}\isactrlsub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ {\isasymtau}\isactrlsub k{\isacharparenright}{\isasymkappa}}.
|
20451
|
96 |
|
20514
|
97 |
A \emph{type abbreviation} is a syntactic definition \isa{{\isacharparenleft}\isactrlvec {\isasymalpha}{\isacharparenright}{\isasymkappa}\ {\isacharequal}\ {\isasymtau}} of an arbitrary type expression \isa{{\isasymtau}} over
|
20537
|
98 |
variables \isa{\isactrlvec {\isasymalpha}}. Type abbreviations appear as type
|
|
99 |
constructors in the syntax, but are expanded before entering the
|
|
100 |
logical core.
|
20451
|
101 |
|
20481
|
102 |
A \emph{type arity} declares the image behavior of a type
|
20494
|
103 |
constructor wrt.\ the algebra of sorts: \isa{{\isasymkappa}\ {\isacharcolon}{\isacharcolon}\ {\isacharparenleft}s\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ s\isactrlisub k{\isacharparenright}s} means that \isa{{\isacharparenleft}{\isasymtau}\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ {\isasymtau}\isactrlisub k{\isacharparenright}{\isasymkappa}} is
|
|
104 |
of sort \isa{s} if every argument type \isa{{\isasymtau}\isactrlisub i} is
|
|
105 |
of sort \isa{s\isactrlisub i}. Arity declarations are implicitly
|
|
106 |
completed, i.e.\ \isa{{\isasymkappa}\ {\isacharcolon}{\isacharcolon}\ {\isacharparenleft}\isactrlvec s{\isacharparenright}c} entails \isa{{\isasymkappa}\ {\isacharcolon}{\isacharcolon}\ {\isacharparenleft}\isactrlvec s{\isacharparenright}c{\isacharprime}} for any \isa{c{\isacharprime}\ {\isasymsupseteq}\ c}.
|
20451
|
107 |
|
20491
|
108 |
\medskip The sort algebra is always maintained as \emph{coregular},
|
|
109 |
which means that type arities are consistent with the subclass
|
20537
|
110 |
relation: for any type constructor \isa{{\isasymkappa}}, and classes \isa{c\isactrlisub {\isadigit{1}}\ {\isasymsubseteq}\ c\isactrlisub {\isadigit{2}}}, and arities \isa{{\isasymkappa}\ {\isacharcolon}{\isacharcolon}\ {\isacharparenleft}\isactrlvec s\isactrlisub {\isadigit{1}}{\isacharparenright}c\isactrlisub {\isadigit{1}}} and \isa{{\isasymkappa}\ {\isacharcolon}{\isacharcolon}\ {\isacharparenleft}\isactrlvec s\isactrlisub {\isadigit{2}}{\isacharparenright}c\isactrlisub {\isadigit{2}}} holds \isa{\isactrlvec s\isactrlisub {\isadigit{1}}\ {\isasymsubseteq}\ \isactrlvec s\isactrlisub {\isadigit{2}}} component-wise.
|
20491
|
111 |
|
|
112 |
The key property of a coregular order-sorted algebra is that sort
|
20537
|
113 |
constraints can be solved in a most general fashion: for each type
|
|
114 |
constructor \isa{{\isasymkappa}} and sort \isa{s} there is a most general
|
|
115 |
vector of argument sorts \isa{{\isacharparenleft}s\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ s\isactrlisub k{\isacharparenright}} such
|
|
116 |
that a type scheme \isa{{\isacharparenleft}{\isasymalpha}\isactrlbsub s\isactrlisub {\isadigit{1}}\isactrlesub {\isacharcomma}\ {\isasymdots}{\isacharcomma}\ {\isasymalpha}\isactrlbsub s\isactrlisub k\isactrlesub {\isacharparenright}{\isasymkappa}} is of sort \isa{s}.
|
20543
|
117 |
Consequently, type unification has most general solutions (modulo
|
|
118 |
equivalence of sorts), so type-inference produces primary types as
|
|
119 |
expected \cite{nipkow-prehofer}.%
|
18537
|
120 |
\end{isamarkuptext}%
|
|
121 |
\isamarkuptrue%
|
|
122 |
%
|
20481
|
123 |
\isadelimmlref
|
|
124 |
%
|
|
125 |
\endisadelimmlref
|
|
126 |
%
|
|
127 |
\isatagmlref
|
|
128 |
%
|
|
129 |
\begin{isamarkuptext}%
|
|
130 |
\begin{mldecls}
|
|
131 |
\indexmltype{class}\verb|type class| \\
|
|
132 |
\indexmltype{sort}\verb|type sort| \\
|
20494
|
133 |
\indexmltype{arity}\verb|type arity| \\
|
20481
|
134 |
\indexmltype{typ}\verb|type typ| \\
|
20519
|
135 |
\indexml{map-atyps}\verb|map_atyps: (typ -> typ) -> typ -> typ| \\
|
20494
|
136 |
\indexml{fold-atyps}\verb|fold_atyps: (typ -> 'a -> 'a) -> typ -> 'a -> 'a| \\
|
20481
|
137 |
\indexml{Sign.subsort}\verb|Sign.subsort: theory -> sort * sort -> bool| \\
|
|
138 |
\indexml{Sign.of-sort}\verb|Sign.of_sort: theory -> typ * sort -> bool| \\
|
20520
|
139 |
\indexml{Sign.add-types}\verb|Sign.add_types: (string * int * mixfix) list -> theory -> theory| \\
|
20481
|
140 |
\indexml{Sign.add-tyabbrs-i}\verb|Sign.add_tyabbrs_i: |\isasep\isanewline%
|
20520
|
141 |
\verb| (string * string list * typ * mixfix) list -> theory -> theory| \\
|
20481
|
142 |
\indexml{Sign.primitive-class}\verb|Sign.primitive_class: string * class list -> theory -> theory| \\
|
|
143 |
\indexml{Sign.primitive-classrel}\verb|Sign.primitive_classrel: class * class -> theory -> theory| \\
|
|
144 |
\indexml{Sign.primitive-arity}\verb|Sign.primitive_arity: arity -> theory -> theory| \\
|
|
145 |
\end{mldecls}
|
|
146 |
|
|
147 |
\begin{description}
|
|
148 |
|
|
149 |
\item \verb|class| represents type classes; this is an alias for
|
|
150 |
\verb|string|.
|
|
151 |
|
|
152 |
\item \verb|sort| represents sorts; this is an alias for
|
|
153 |
\verb|class list|.
|
|
154 |
|
|
155 |
\item \verb|arity| represents type arities; this is an alias for
|
20494
|
156 |
triples of the form \isa{{\isacharparenleft}{\isasymkappa}{\isacharcomma}\ \isactrlvec s{\isacharcomma}\ s{\isacharparenright}} for \isa{{\isasymkappa}\ {\isacharcolon}{\isacharcolon}\ {\isacharparenleft}\isactrlvec s{\isacharparenright}s} described above.
|
20481
|
157 |
|
|
158 |
\item \verb|typ| represents types; this is a datatype with
|
|
159 |
constructors \verb|TFree|, \verb|TVar|, \verb|Type|.
|
|
160 |
|
20537
|
161 |
\item \verb|map_atyps|~\isa{f\ {\isasymtau}} applies the mapping \isa{f}
|
|
162 |
to all atomic types (\verb|TFree|, \verb|TVar|) occurring in \isa{{\isasymtau}}.
|
20519
|
163 |
|
20537
|
164 |
\item \verb|fold_atyps|~\isa{f\ {\isasymtau}} iterates the operation \isa{f} over all occurrences of atomic types (\verb|TFree|, \verb|TVar|)
|
|
165 |
in \isa{{\isasymtau}}; the type structure is traversed from left to right.
|
20494
|
166 |
|
20481
|
167 |
\item \verb|Sign.subsort|~\isa{thy\ {\isacharparenleft}s\isactrlisub {\isadigit{1}}{\isacharcomma}\ s\isactrlisub {\isadigit{2}}{\isacharparenright}}
|
|
168 |
tests the subsort relation \isa{s\isactrlisub {\isadigit{1}}\ {\isasymsubseteq}\ s\isactrlisub {\isadigit{2}}}.
|
|
169 |
|
20537
|
170 |
\item \verb|Sign.of_sort|~\isa{thy\ {\isacharparenleft}{\isasymtau}{\isacharcomma}\ s{\isacharparenright}} tests whether type
|
|
171 |
\isa{{\isasymtau}} is of sort \isa{s}.
|
20481
|
172 |
|
20537
|
173 |
\item \verb|Sign.add_types|~\isa{{\isacharbrackleft}{\isacharparenleft}{\isasymkappa}{\isacharcomma}\ k{\isacharcomma}\ mx{\isacharparenright}{\isacharcomma}\ {\isasymdots}{\isacharbrackright}} declares a new
|
20494
|
174 |
type constructors \isa{{\isasymkappa}} with \isa{k} arguments and
|
20481
|
175 |
optional mixfix syntax.
|
|
176 |
|
20494
|
177 |
\item \verb|Sign.add_tyabbrs_i|~\isa{{\isacharbrackleft}{\isacharparenleft}{\isasymkappa}{\isacharcomma}\ \isactrlvec {\isasymalpha}{\isacharcomma}\ {\isasymtau}{\isacharcomma}\ mx{\isacharparenright}{\isacharcomma}\ {\isasymdots}{\isacharbrackright}}
|
|
178 |
defines a new type abbreviation \isa{{\isacharparenleft}\isactrlvec {\isasymalpha}{\isacharparenright}{\isasymkappa}\ {\isacharequal}\ {\isasymtau}} with
|
20491
|
179 |
optional mixfix syntax.
|
20481
|
180 |
|
20537
|
181 |
\item \verb|Sign.primitive_class|~\isa{{\isacharparenleft}c{\isacharcomma}\ {\isacharbrackleft}c\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ c\isactrlisub n{\isacharbrackright}{\isacharparenright}} declares a new class \isa{c}, together with class
|
20494
|
182 |
relations \isa{c\ {\isasymsubseteq}\ c\isactrlisub i}, for \isa{i\ {\isacharequal}\ {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ n}.
|
20481
|
183 |
|
20543
|
184 |
\item \verb|Sign.primitive_classrel|~\isa{{\isacharparenleft}c\isactrlisub {\isadigit{1}}{\isacharcomma}\ c\isactrlisub {\isadigit{2}}{\isacharparenright}} declares the class relation \isa{c\isactrlisub {\isadigit{1}}\ {\isasymsubseteq}\ c\isactrlisub {\isadigit{2}}}.
|
20481
|
185 |
|
20494
|
186 |
\item \verb|Sign.primitive_arity|~\isa{{\isacharparenleft}{\isasymkappa}{\isacharcomma}\ \isactrlvec s{\isacharcomma}\ s{\isacharparenright}} declares
|
20537
|
187 |
the arity \isa{{\isasymkappa}\ {\isacharcolon}{\isacharcolon}\ {\isacharparenleft}\isactrlvec s{\isacharparenright}s}.
|
20481
|
188 |
|
|
189 |
\end{description}%
|
|
190 |
\end{isamarkuptext}%
|
|
191 |
\isamarkuptrue%
|
|
192 |
%
|
|
193 |
\endisatagmlref
|
|
194 |
{\isafoldmlref}%
|
|
195 |
%
|
|
196 |
\isadelimmlref
|
|
197 |
%
|
|
198 |
\endisadelimmlref
|
|
199 |
%
|
20451
|
200 |
\isamarkupsection{Terms \label{sec:terms}%
|
18537
|
201 |
}
|
|
202 |
\isamarkuptrue%
|
|
203 |
%
|
|
204 |
\begin{isamarkuptext}%
|
20451
|
205 |
\glossary{Term}{FIXME}
|
18537
|
206 |
|
20491
|
207 |
The language of terms is that of simply-typed \isa{{\isasymlambda}}-calculus
|
20520
|
208 |
with de-Bruijn indices for bound variables (cf.\ \cite{debruijn72}
|
20537
|
209 |
or \cite{paulson-ml2}), with the types being determined determined
|
|
210 |
by the corresponding binders. In contrast, free variables and
|
|
211 |
constants are have an explicit name and type in each occurrence.
|
20514
|
212 |
|
|
213 |
\medskip A \emph{bound variable} is a natural number \isa{b},
|
20537
|
214 |
which accounts for the number of intermediate binders between the
|
|
215 |
variable occurrence in the body and its binding position. For
|
20543
|
216 |
example, the de-Bruijn term \isa{{\isasymlambda}\isactrlbsub nat\isactrlesub {\isachardot}\ {\isasymlambda}\isactrlbsub nat\isactrlesub {\isachardot}\ {\isadigit{1}}\ {\isacharplus}\ {\isadigit{0}}} would
|
|
217 |
correspond to \isa{{\isasymlambda}x\isactrlbsub nat\isactrlesub {\isachardot}\ {\isasymlambda}y\isactrlbsub nat\isactrlesub {\isachardot}\ x\ {\isacharplus}\ y} in a named
|
|
218 |
representation. Note that a bound variable may be represented by
|
|
219 |
different de-Bruijn indices at different occurrences, depending on
|
|
220 |
the nesting of abstractions.
|
20537
|
221 |
|
20543
|
222 |
A \emph{loose variable} is a bound variable that is outside the
|
20537
|
223 |
scope of local binders. The types (and names) for loose variables
|
20543
|
224 |
can be managed as a separate context, that is maintained as a stack
|
|
225 |
of hypothetical binders. The core logic operates on closed terms,
|
|
226 |
without any loose variables.
|
20514
|
227 |
|
20537
|
228 |
A \emph{fixed variable} is a pair of a basic name and a type, e.g.\
|
|
229 |
\isa{{\isacharparenleft}x{\isacharcomma}\ {\isasymtau}{\isacharparenright}} which is usually printed \isa{x\isactrlisub {\isasymtau}}. A
|
|
230 |
\emph{schematic variable} is a pair of an indexname and a type,
|
|
231 |
e.g.\ \isa{{\isacharparenleft}{\isacharparenleft}x{\isacharcomma}\ {\isadigit{0}}{\isacharparenright}{\isacharcomma}\ {\isasymtau}{\isacharparenright}} which is usually printed as \isa{{\isacharquery}x\isactrlisub {\isasymtau}}.
|
20491
|
232 |
|
20537
|
233 |
\medskip A \emph{constant} is a pair of a basic name and a type,
|
|
234 |
e.g.\ \isa{{\isacharparenleft}c{\isacharcomma}\ {\isasymtau}{\isacharparenright}} which is usually printed as \isa{c\isactrlisub {\isasymtau}}. Constants are declared in the context as polymorphic
|
20543
|
235 |
families \isa{c\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}}, meaning that all substitution instances
|
|
236 |
\isa{c\isactrlisub {\isasymtau}} for \isa{{\isasymtau}\ {\isacharequal}\ {\isasymsigma}{\isasymvartheta}} are valid.
|
20514
|
237 |
|
20537
|
238 |
The vector of \emph{type arguments} of constant \isa{c\isactrlisub {\isasymtau}}
|
|
239 |
wrt.\ the declaration \isa{c\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}} is defined as the codomain of
|
|
240 |
the matcher \isa{{\isasymvartheta}\ {\isacharequal}\ {\isacharbraceleft}{\isacharquery}{\isasymalpha}\isactrlisub {\isadigit{1}}\ {\isasymmapsto}\ {\isasymtau}\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ {\isacharquery}{\isasymalpha}\isactrlisub n\ {\isasymmapsto}\ {\isasymtau}\isactrlisub n{\isacharbraceright}} presented in canonical order \isa{{\isacharparenleft}{\isasymtau}\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ {\isasymtau}\isactrlisub n{\isacharparenright}}. Within a given theory context,
|
|
241 |
there is a one-to-one correspondence between any constant \isa{c\isactrlisub {\isasymtau}} and the application \isa{c{\isacharparenleft}{\isasymtau}\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ {\isasymtau}\isactrlisub n{\isacharparenright}} of its type arguments. For example, with \isa{plus\ {\isacharcolon}{\isacharcolon}\ {\isasymalpha}\ {\isasymRightarrow}\ {\isasymalpha}\ {\isasymRightarrow}\ {\isasymalpha}}, the instance \isa{plus\isactrlbsub nat\ {\isasymRightarrow}\ nat\ {\isasymRightarrow}\ nat\isactrlesub } corresponds to \isa{plus{\isacharparenleft}nat{\isacharparenright}}.
|
20481
|
242 |
|
20514
|
243 |
Constant declarations \isa{c\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}} may contain sort constraints
|
|
244 |
for type variables in \isa{{\isasymsigma}}. These are observed by
|
|
245 |
type-inference as expected, but \emph{ignored} by the core logic.
|
|
246 |
This means the primitive logic is able to reason with instances of
|
20537
|
247 |
polymorphic constants that the user-level type-checker would reject
|
|
248 |
due to violation of type class restrictions.
|
20481
|
249 |
|
20543
|
250 |
\medskip An \emph{atomic} term is either a variable or constant. A
|
|
251 |
\emph{term} is defined inductively over atomic terms, with
|
|
252 |
abstraction and application as follows: \isa{t\ {\isacharequal}\ b\ {\isacharbar}\ x\isactrlisub {\isasymtau}\ {\isacharbar}\ {\isacharquery}x\isactrlisub {\isasymtau}\ {\isacharbar}\ c\isactrlisub {\isasymtau}\ {\isacharbar}\ {\isasymlambda}\isactrlisub {\isasymtau}{\isachardot}\ t\ {\isacharbar}\ t\isactrlisub {\isadigit{1}}\ t\isactrlisub {\isadigit{2}}}.
|
|
253 |
Parsing and printing takes care of converting between an external
|
|
254 |
representation with named bound variables. Subsequently, we shall
|
|
255 |
use the latter notation instead of internal de-Bruijn
|
|
256 |
representation.
|
20499
|
257 |
|
20537
|
258 |
The inductive relation \isa{t\ {\isacharcolon}{\isacharcolon}\ {\isasymtau}} assigns a (unique) type to a
|
|
259 |
term according to the structure of atomic terms, abstractions, and
|
|
260 |
applicatins:
|
20499
|
261 |
\[
|
20502
|
262 |
\infer{\isa{a\isactrlisub {\isasymtau}\ {\isacharcolon}{\isacharcolon}\ {\isasymtau}}}{}
|
20499
|
263 |
\qquad
|
20502
|
264 |
\infer{\isa{{\isacharparenleft}{\isasymlambda}x\isactrlsub {\isasymtau}{\isachardot}\ t{\isacharparenright}\ {\isacharcolon}{\isacharcolon}\ {\isasymtau}\ {\isasymRightarrow}\ {\isasymsigma}}}{\isa{t\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}}}
|
|
265 |
\qquad
|
|
266 |
\infer{\isa{t\ u\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}}}{\isa{t\ {\isacharcolon}{\isacharcolon}\ {\isasymtau}\ {\isasymRightarrow}\ {\isasymsigma}} & \isa{u\ {\isacharcolon}{\isacharcolon}\ {\isasymtau}}}
|
20514
|
267 |
\]
|
|
268 |
A \emph{well-typed term} is a term that can be typed according to these rules.
|
|
269 |
|
|
270 |
Typing information can be omitted: type-inference is able to
|
|
271 |
reconstruct the most general type of a raw term, while assigning
|
|
272 |
most general types to all of its variables and constants.
|
|
273 |
Type-inference depends on a context of type constraints for fixed
|
|
274 |
variables, and declarations for polymorphic constants.
|
|
275 |
|
20537
|
276 |
The identity of atomic terms consists both of the name and the type
|
|
277 |
component. This means that different variables \isa{x\isactrlbsub {\isasymtau}\isactrlisub {\isadigit{1}}\isactrlesub } and \isa{x\isactrlbsub {\isasymtau}\isactrlisub {\isadigit{2}}\isactrlesub } may become the same after type
|
|
278 |
instantiation. Some outer layers of the system make it hard to
|
|
279 |
produce variables of the same name, but different types. In
|
20543
|
280 |
contrast, mixed instances of polymorphic constants occur frequently.
|
20514
|
281 |
|
|
282 |
\medskip The \emph{hidden polymorphism} of a term \isa{t\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}}
|
|
283 |
is the set of type variables occurring in \isa{t}, but not in
|
20537
|
284 |
\isa{{\isasymsigma}}. This means that the term implicitly depends on type
|
20543
|
285 |
arguments that are not accounted in the result type, i.e.\ there are
|
20537
|
286 |
different type instances \isa{t{\isasymvartheta}\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}} and \isa{t{\isasymvartheta}{\isacharprime}\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}} with the same type. This slightly
|
20543
|
287 |
pathological situation notoriously demands additional care.
|
20514
|
288 |
|
20537
|
289 |
\medskip A \emph{term abbreviation} is a syntactic definition \isa{c\isactrlisub {\isasymsigma}\ {\isasymequiv}\ t} of a closed term \isa{t} of type \isa{{\isasymsigma}},
|
|
290 |
without any hidden polymorphism. A term abbreviation looks like a
|
20543
|
291 |
constant in the syntax, but is expanded before entering the logical
|
|
292 |
core. Abbreviations are usually reverted when printing terms, using
|
|
293 |
\isa{t\ {\isasymrightarrow}\ c\isactrlisub {\isasymsigma}} as rules for higher-order rewriting.
|
20519
|
294 |
|
20537
|
295 |
\medskip Canonical operations on \isa{{\isasymlambda}}-terms include \isa{{\isasymalpha}{\isasymbeta}{\isasymeta}}-conversion: \isa{{\isasymalpha}}-conversion refers to capture-free
|
20519
|
296 |
renaming of bound variables; \isa{{\isasymbeta}}-conversion contracts an
|
20537
|
297 |
abstraction applied to an argument term, substituting the argument
|
20519
|
298 |
in the body: \isa{{\isacharparenleft}{\isasymlambda}x{\isachardot}\ b{\isacharparenright}a} becomes \isa{b{\isacharbrackleft}a{\isacharslash}x{\isacharbrackright}}; \isa{{\isasymeta}}-conversion contracts vacuous application-abstraction: \isa{{\isasymlambda}x{\isachardot}\ f\ x} becomes \isa{f}, provided that the bound variable
|
20537
|
299 |
does not occur in \isa{f}.
|
20519
|
300 |
|
20537
|
301 |
Terms are normally treated modulo \isa{{\isasymalpha}}-conversion, which is
|
|
302 |
implicit in the de-Bruijn representation. Names for bound variables
|
|
303 |
in abstractions are maintained separately as (meaningless) comments,
|
|
304 |
mostly for parsing and printing. Full \isa{{\isasymalpha}{\isasymbeta}{\isasymeta}}-conversion is
|
20543
|
305 |
commonplace in various standard operations (\secref{sec:rules}) that
|
20537
|
306 |
are based on higher-order unification and matching.%
|
18537
|
307 |
\end{isamarkuptext}%
|
|
308 |
\isamarkuptrue%
|
|
309 |
%
|
20514
|
310 |
\isadelimmlref
|
|
311 |
%
|
|
312 |
\endisadelimmlref
|
|
313 |
%
|
|
314 |
\isatagmlref
|
|
315 |
%
|
18537
|
316 |
\begin{isamarkuptext}%
|
20514
|
317 |
\begin{mldecls}
|
|
318 |
\indexmltype{term}\verb|type term| \\
|
20519
|
319 |
\indexml{op aconv}\verb|op aconv: term * term -> bool| \\
|
|
320 |
\indexml{map-term-types}\verb|map_term_types: (typ -> typ) -> term -> term| \\ %FIXME rename map_types
|
|
321 |
\indexml{fold-types}\verb|fold_types: (typ -> 'a -> 'a) -> term -> 'a -> 'a| \\
|
20514
|
322 |
\indexml{map-aterms}\verb|map_aterms: (term -> term) -> term -> term| \\
|
|
323 |
\indexml{fold-aterms}\verb|fold_aterms: (term -> 'a -> 'a) -> term -> 'a -> 'a| \\
|
|
324 |
\indexml{fastype-of}\verb|fastype_of: term -> typ| \\
|
20519
|
325 |
\indexml{lambda}\verb|lambda: term -> term -> term| \\
|
|
326 |
\indexml{betapply}\verb|betapply: term * term -> term| \\
|
20520
|
327 |
\indexml{Sign.add-consts-i}\verb|Sign.add_consts_i: (string * typ * mixfix) list -> theory -> theory| \\
|
20519
|
328 |
\indexml{Sign.add-abbrevs}\verb|Sign.add_abbrevs: string * bool ->|\isasep\isanewline%
|
20520
|
329 |
\verb| ((string * mixfix) * term) list -> theory -> theory| \\
|
20519
|
330 |
\indexml{Sign.const-typargs}\verb|Sign.const_typargs: theory -> string * typ -> typ list| \\
|
|
331 |
\indexml{Sign.const-instance}\verb|Sign.const_instance: theory -> string * typ list -> typ| \\
|
20514
|
332 |
\end{mldecls}
|
18537
|
333 |
|
20514
|
334 |
\begin{description}
|
18537
|
335 |
|
20537
|
336 |
\item \verb|term| represents de-Bruijn terms, with comments in
|
|
337 |
abstractions, and explicitly named free variables and constants;
|
|
338 |
this is a datatype with constructors \verb|Bound|, \verb|Free|, \verb|Var|, \verb|Const|, \verb|Abs|, \verb|op $|.
|
20519
|
339 |
|
|
340 |
\item \isa{t}~\verb|aconv|~\isa{u} checks \isa{{\isasymalpha}}-equivalence of two terms. This is the basic equality relation
|
|
341 |
on type \verb|term|; raw datatype equality should only be used
|
|
342 |
for operations related to parsing or printing!
|
|
343 |
|
20537
|
344 |
\item \verb|map_term_types|~\isa{f\ t} applies the mapping \isa{f} to all types occurring in \isa{t}.
|
|
345 |
|
|
346 |
\item \verb|fold_types|~\isa{f\ t} iterates the operation \isa{f} over all occurrences of types in \isa{t}; the term
|
|
347 |
structure is traversed from left to right.
|
20519
|
348 |
|
20537
|
349 |
\item \verb|map_aterms|~\isa{f\ t} applies the mapping \isa{f}
|
|
350 |
to all atomic terms (\verb|Bound|, \verb|Free|, \verb|Var|, \verb|Const|) occurring in \isa{t}.
|
|
351 |
|
|
352 |
\item \verb|fold_aterms|~\isa{f\ t} iterates the operation \isa{f} over all occurrences of atomic terms (\verb|Bound|, \verb|Free|,
|
|
353 |
\verb|Var|, \verb|Const|) in \isa{t}; the term structure is
|
20519
|
354 |
traversed from left to right.
|
|
355 |
|
20537
|
356 |
\item \verb|fastype_of|~\isa{t} determines the type of a
|
|
357 |
well-typed term. This operation is relatively slow, despite the
|
|
358 |
omission of any sanity checks.
|
20519
|
359 |
|
20537
|
360 |
\item \verb|lambda|~\isa{a\ b} produces an abstraction \isa{{\isasymlambda}a{\isachardot}\ b}, where occurrences of the atomic term \isa{a} in the
|
|
361 |
body \isa{b} are replaced by bound variables.
|
20519
|
362 |
|
20537
|
363 |
\item \verb|betapply|~\isa{{\isacharparenleft}t{\isacharcomma}\ u{\isacharparenright}} produces an application \isa{t\ u}, with topmost \isa{{\isasymbeta}}-conversion if \isa{t} is an
|
|
364 |
abstraction.
|
20519
|
365 |
|
|
366 |
\item \verb|Sign.add_consts_i|~\isa{{\isacharbrackleft}{\isacharparenleft}c{\isacharcomma}\ {\isasymsigma}{\isacharcomma}\ mx{\isacharparenright}{\isacharcomma}\ {\isasymdots}{\isacharbrackright}} declares a
|
|
367 |
new constant \isa{c\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}} with optional mixfix syntax.
|
|
368 |
|
|
369 |
\item \verb|Sign.add_abbrevs|~\isa{print{\isacharunderscore}mode\ {\isacharbrackleft}{\isacharparenleft}{\isacharparenleft}c{\isacharcomma}\ t{\isacharparenright}{\isacharcomma}\ mx{\isacharparenright}{\isacharcomma}\ {\isasymdots}{\isacharbrackright}}
|
|
370 |
declares a new term abbreviation \isa{c\ {\isasymequiv}\ t} with optional
|
|
371 |
mixfix syntax.
|
|
372 |
|
20520
|
373 |
\item \verb|Sign.const_typargs|~\isa{thy\ {\isacharparenleft}c{\isacharcomma}\ {\isasymtau}{\isacharparenright}} and \verb|Sign.const_instance|~\isa{thy\ {\isacharparenleft}c{\isacharcomma}\ {\isacharbrackleft}{\isasymtau}\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ {\isasymtau}\isactrlisub n{\isacharbrackright}{\isacharparenright}}
|
20543
|
374 |
convert between two representations of polymorphic constants: full
|
|
375 |
type instance vs.\ compact type arguments form.
|
20514
|
376 |
|
|
377 |
\end{description}%
|
18537
|
378 |
\end{isamarkuptext}%
|
|
379 |
\isamarkuptrue%
|
|
380 |
%
|
20514
|
381 |
\endisatagmlref
|
|
382 |
{\isafoldmlref}%
|
|
383 |
%
|
|
384 |
\isadelimmlref
|
|
385 |
%
|
|
386 |
\endisadelimmlref
|
|
387 |
%
|
20451
|
388 |
\isamarkupsection{Theorems \label{sec:thms}%
|
18537
|
389 |
}
|
|
390 |
\isamarkuptrue%
|
|
391 |
%
|
|
392 |
\begin{isamarkuptext}%
|
20521
|
393 |
\glossary{Proposition}{FIXME A \seeglossary{term} of
|
|
394 |
\seeglossary{type} \isa{prop}. Internally, there is nothing
|
|
395 |
special about propositions apart from their type, but the concrete
|
|
396 |
syntax enforces a clear distinction. Propositions are structured
|
|
397 |
via implication \isa{A\ {\isasymLongrightarrow}\ B} or universal quantification \isa{{\isasymAnd}x{\isachardot}\ B\ x} --- anything else is considered atomic. The canonical
|
|
398 |
form for propositions is that of a \seeglossary{Hereditary Harrop
|
|
399 |
Formula}. FIXME}
|
20481
|
400 |
|
20502
|
401 |
\glossary{Theorem}{A proven proposition within a certain theory and
|
|
402 |
proof context, formally \isa{{\isasymGamma}\ {\isasymturnstile}\isactrlsub {\isasymTheta}\ {\isasymphi}}; both contexts are
|
|
403 |
rarely spelled out explicitly. Theorems are usually normalized
|
|
404 |
according to the \seeglossary{HHF} format. FIXME}
|
18537
|
405 |
|
20519
|
406 |
\glossary{Fact}{Sometimes used interchangeably for
|
20502
|
407 |
\seeglossary{theorem}. Strictly speaking, a list of theorems,
|
|
408 |
essentially an extra-logical conjunction. Facts emerge either as
|
|
409 |
local assumptions, or as results of local goal statements --- both
|
|
410 |
may be simultaneous, hence the list representation. FIXME}
|
|
411 |
|
|
412 |
\glossary{Schematic variable}{FIXME}
|
|
413 |
|
|
414 |
\glossary{Fixed variable}{A variable that is bound within a certain
|
|
415 |
proof context; an arbitrary-but-fixed entity within a portion of
|
|
416 |
proof text. FIXME}
|
18537
|
417 |
|
20502
|
418 |
\glossary{Free variable}{Synonymous for \seeglossary{fixed
|
|
419 |
variable}. FIXME}
|
|
420 |
|
|
421 |
\glossary{Bound variable}{FIXME}
|
18537
|
422 |
|
20502
|
423 |
\glossary{Variable}{See \seeglossary{schematic variable},
|
|
424 |
\seeglossary{fixed variable}, \seeglossary{bound variable}, or
|
|
425 |
\seeglossary{type variable}. The distinguishing feature of
|
|
426 |
different variables is their binding scope. FIXME}
|
18537
|
427 |
|
20543
|
428 |
A \emph{proposition} is a well-typed term of type \isa{prop}, a
|
20521
|
429 |
\emph{theorem} is a proven proposition (depending on a context of
|
|
430 |
hypotheses and the background theory). Primitive inferences include
|
20537
|
431 |
plain natural deduction rules for the primary connectives \isa{{\isasymAnd}} and \isa{{\isasymLongrightarrow}} of the framework. There is also a builtin
|
|
432 |
notion of equality/equivalence \isa{{\isasymequiv}}.%
|
20521
|
433 |
\end{isamarkuptext}%
|
|
434 |
\isamarkuptrue%
|
|
435 |
%
|
20537
|
436 |
\isamarkupsubsection{Primitive connectives and rules%
|
20521
|
437 |
}
|
|
438 |
\isamarkuptrue%
|
|
439 |
%
|
|
440 |
\begin{isamarkuptext}%
|
20543
|
441 |
The theory \isa{Pure} contains constant declarations for the
|
|
442 |
primitive connectives \isa{{\isasymAnd}}, \isa{{\isasymLongrightarrow}}, and \isa{{\isasymequiv}} of
|
|
443 |
the logical framework, see \figref{fig:pure-connectives}. The
|
|
444 |
derivability judgment \isa{A\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ A\isactrlisub n\ {\isasymturnstile}\ B} is
|
|
445 |
defined inductively by the primitive inferences given in
|
|
446 |
\figref{fig:prim-rules}, with the global restriction that the
|
|
447 |
hypotheses must \emph{not} contain any schematic variables. The
|
|
448 |
builtin equality is conceptually axiomatized as shown in
|
20521
|
449 |
\figref{fig:pure-equality}, although the implementation works
|
20543
|
450 |
directly with derived inferences.
|
18537
|
451 |
|
20521
|
452 |
\begin{figure}[htb]
|
|
453 |
\begin{center}
|
20502
|
454 |
\begin{tabular}{ll}
|
|
455 |
\isa{all\ {\isacharcolon}{\isacharcolon}\ {\isacharparenleft}{\isasymalpha}\ {\isasymRightarrow}\ prop{\isacharparenright}\ {\isasymRightarrow}\ prop} & universal quantification (binder \isa{{\isasymAnd}}) \\
|
|
456 |
\isa{{\isasymLongrightarrow}\ {\isacharcolon}{\isacharcolon}\ prop\ {\isasymRightarrow}\ prop\ {\isasymRightarrow}\ prop} & implication (right associative infix) \\
|
20521
|
457 |
\isa{{\isasymequiv}\ {\isacharcolon}{\isacharcolon}\ {\isasymalpha}\ {\isasymRightarrow}\ {\isasymalpha}\ {\isasymRightarrow}\ prop} & equality relation (infix) \\
|
20502
|
458 |
\end{tabular}
|
20537
|
459 |
\caption{Primitive connectives of Pure}\label{fig:pure-connectives}
|
20521
|
460 |
\end{center}
|
|
461 |
\end{figure}
|
18537
|
462 |
|
20502
|
463 |
\begin{figure}[htb]
|
|
464 |
\begin{center}
|
20499
|
465 |
\[
|
|
466 |
\infer[\isa{{\isacharparenleft}axiom{\isacharparenright}}]{\isa{{\isasymturnstile}\ A}}{\isa{A\ {\isasymin}\ {\isasymTheta}}}
|
|
467 |
\qquad
|
|
468 |
\infer[\isa{{\isacharparenleft}assume{\isacharparenright}}]{\isa{A\ {\isasymturnstile}\ A}}{}
|
|
469 |
\]
|
|
470 |
\[
|
20537
|
471 |
\infer[\isa{{\isacharparenleft}{\isasymAnd}{\isacharunderscore}intro{\isacharparenright}}]{\isa{{\isasymGamma}\ {\isasymturnstile}\ {\isasymAnd}x{\isachardot}\ b{\isacharbrackleft}x{\isacharbrackright}}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ b{\isacharbrackleft}x{\isacharbrackright}} & \isa{x\ {\isasymnotin}\ {\isasymGamma}}}
|
20499
|
472 |
\qquad
|
20537
|
473 |
\infer[\isa{{\isacharparenleft}{\isasymAnd}{\isacharunderscore}elim{\isacharparenright}}]{\isa{{\isasymGamma}\ {\isasymturnstile}\ b{\isacharbrackleft}a{\isacharbrackright}}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ {\isasymAnd}x{\isachardot}\ b{\isacharbrackleft}x{\isacharbrackright}}}
|
20499
|
474 |
\]
|
|
475 |
\[
|
|
476 |
\infer[\isa{{\isacharparenleft}{\isasymLongrightarrow}{\isacharunderscore}intro{\isacharparenright}}]{\isa{{\isasymGamma}\ {\isacharminus}\ A\ {\isasymturnstile}\ A\ {\isasymLongrightarrow}\ B}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ B}}
|
|
477 |
\qquad
|
|
478 |
\infer[\isa{{\isacharparenleft}{\isasymLongrightarrow}{\isacharunderscore}elim{\isacharparenright}}]{\isa{{\isasymGamma}\isactrlsub {\isadigit{1}}\ {\isasymunion}\ {\isasymGamma}\isactrlsub {\isadigit{2}}\ {\isasymturnstile}\ B}}{\isa{{\isasymGamma}\isactrlsub {\isadigit{1}}\ {\isasymturnstile}\ A\ {\isasymLongrightarrow}\ B} & \isa{{\isasymGamma}\isactrlsub {\isadigit{2}}\ {\isasymturnstile}\ A}}
|
|
479 |
\]
|
20521
|
480 |
\caption{Primitive inferences of Pure}\label{fig:prim-rules}
|
|
481 |
\end{center}
|
|
482 |
\end{figure}
|
|
483 |
|
|
484 |
\begin{figure}[htb]
|
|
485 |
\begin{center}
|
|
486 |
\begin{tabular}{ll}
|
20537
|
487 |
\isa{{\isasymturnstile}\ {\isacharparenleft}{\isasymlambda}x{\isachardot}\ b{\isacharbrackleft}x{\isacharbrackright}{\isacharparenright}\ a\ {\isasymequiv}\ b{\isacharbrackleft}a{\isacharbrackright}} & \isa{{\isasymbeta}}-conversion \\
|
20521
|
488 |
\isa{{\isasymturnstile}\ x\ {\isasymequiv}\ x} & reflexivity \\
|
|
489 |
\isa{{\isasymturnstile}\ x\ {\isasymequiv}\ y\ {\isasymLongrightarrow}\ P\ x\ {\isasymLongrightarrow}\ P\ y} & substitution \\
|
|
490 |
\isa{{\isasymturnstile}\ {\isacharparenleft}{\isasymAnd}x{\isachardot}\ f\ x\ {\isasymequiv}\ g\ x{\isacharparenright}\ {\isasymLongrightarrow}\ f\ {\isasymequiv}\ g} & extensionality \\
|
20537
|
491 |
\isa{{\isasymturnstile}\ {\isacharparenleft}A\ {\isasymLongrightarrow}\ B{\isacharparenright}\ {\isasymLongrightarrow}\ {\isacharparenleft}B\ {\isasymLongrightarrow}\ A{\isacharparenright}\ {\isasymLongrightarrow}\ A\ {\isasymequiv}\ B} & logical equivalence \\
|
20521
|
492 |
\end{tabular}
|
20542
|
493 |
\caption{Conceptual axiomatization of Pure equality}\label{fig:pure-equality}
|
20502
|
494 |
\end{center}
|
|
495 |
\end{figure}
|
20499
|
496 |
|
20537
|
497 |
The introduction and elimination rules for \isa{{\isasymAnd}} and \isa{{\isasymLongrightarrow}} are analogous to formation of dependently typed \isa{{\isasymlambda}}-terms representing the underlying proof objects. Proof terms
|
20543
|
498 |
are irrelevant in the Pure logic, though; they cannot occur within
|
|
499 |
propositions. The system provides a runtime option to record
|
20537
|
500 |
explicit proof terms for primitive inferences. Thus all three
|
|
501 |
levels of \isa{{\isasymlambda}}-calculus become explicit: \isa{{\isasymRightarrow}} for
|
|
502 |
terms, and \isa{{\isasymAnd}{\isacharslash}{\isasymLongrightarrow}} for proofs (cf.\
|
|
503 |
\cite{Berghofer-Nipkow:2000:TPHOL}).
|
20499
|
504 |
|
20537
|
505 |
Observe that locally fixed parameters (as in \isa{{\isasymAnd}{\isacharunderscore}intro}) need
|
|
506 |
not be recorded in the hypotheses, because the simple syntactic
|
20543
|
507 |
types of Pure are always inhabitable. ``Assumptions'' \isa{x\ {\isacharcolon}{\isacharcolon}\ {\isasymtau}} for type-membership are only present as long as some \isa{x\isactrlisub {\isasymtau}} occurs in the statement body.\footnote{This is the key
|
|
508 |
difference to ``\isa{{\isasymlambda}HOL}'' in the PTS framework
|
|
509 |
\cite{Barendregt-Geuvers:2001}, where hypotheses \isa{x\ {\isacharcolon}\ A} are
|
|
510 |
treated uniformly for propositions and types.}
|
20502
|
511 |
|
|
512 |
\medskip The axiomatization of a theory is implicitly closed by
|
20537
|
513 |
forming all instances of type and term variables: \isa{{\isasymturnstile}\ A{\isasymvartheta}} holds for any substitution instance of an axiom
|
20543
|
514 |
\isa{{\isasymturnstile}\ A}. By pushing substitutions through derivations
|
|
515 |
inductively, we also get admissible \isa{generalize} and \isa{instance} rules as shown in \figref{fig:subst-rules}.
|
20502
|
516 |
|
|
517 |
\begin{figure}[htb]
|
|
518 |
\begin{center}
|
20499
|
519 |
\[
|
20502
|
520 |
\infer{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}{\isacharquery}{\isasymalpha}{\isacharbrackright}}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}{\isasymalpha}{\isacharbrackright}} & \isa{{\isasymalpha}\ {\isasymnotin}\ {\isasymGamma}}}
|
|
521 |
\quad
|
|
522 |
\infer[\quad\isa{{\isacharparenleft}generalize{\isacharparenright}}]{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}{\isacharquery}x{\isacharbrackright}}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}x{\isacharbrackright}} & \isa{x\ {\isasymnotin}\ {\isasymGamma}}}
|
20499
|
523 |
\]
|
|
524 |
\[
|
20502
|
525 |
\infer{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}{\isasymtau}{\isacharbrackright}}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}{\isacharquery}{\isasymalpha}{\isacharbrackright}}}
|
|
526 |
\quad
|
|
527 |
\infer[\quad\isa{{\isacharparenleft}instantiate{\isacharparenright}}]{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}t{\isacharbrackright}}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}{\isacharquery}x{\isacharbrackright}}}
|
20499
|
528 |
\]
|
20502
|
529 |
\caption{Admissible substitution rules}\label{fig:subst-rules}
|
|
530 |
\end{center}
|
|
531 |
\end{figure}
|
20499
|
532 |
|
20537
|
533 |
Note that \isa{instantiate} does not require an explicit
|
|
534 |
side-condition, because \isa{{\isasymGamma}} may never contain schematic
|
|
535 |
variables.
|
|
536 |
|
|
537 |
In principle, variables could be substituted in hypotheses as well,
|
20543
|
538 |
but this would disrupt the monotonicity of reasoning: deriving
|
|
539 |
\isa{{\isasymGamma}{\isasymvartheta}\ {\isasymturnstile}\ B{\isasymvartheta}} from \isa{{\isasymGamma}\ {\isasymturnstile}\ B} is
|
|
540 |
correct, but \isa{{\isasymGamma}{\isasymvartheta}\ {\isasymsupseteq}\ {\isasymGamma}} does not necessarily hold:
|
|
541 |
the result belongs to a different proof context.
|
20542
|
542 |
|
20543
|
543 |
\medskip An \emph{oracle} is a function that produces axioms on the
|
|
544 |
fly. Logically, this is an instance of the \isa{axiom} rule
|
|
545 |
(\figref{fig:prim-rules}), but there is an operational difference.
|
|
546 |
The system always records oracle invocations within derivations of
|
|
547 |
theorems. Tracing plain axioms (and named theorems) is optional.
|
20542
|
548 |
|
|
549 |
Axiomatizations should be limited to the bare minimum, typically as
|
|
550 |
part of the initial logical basis of an object-logic formalization.
|
20543
|
551 |
Later on, theories are usually developed in a strictly definitional
|
|
552 |
fashion, by stating only certain equalities over new constants.
|
20542
|
553 |
|
20543
|
554 |
A \emph{simple definition} consists of a constant declaration \isa{c\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}} together with an axiom \isa{{\isasymturnstile}\ c\ {\isasymequiv}\ t}, where \isa{t\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}} is a closed term without any hidden polymorphism. The RHS
|
|
555 |
may depend on further defined constants, but not \isa{c} itself.
|
|
556 |
Definitions of functions may be presented as \isa{c\ \isactrlvec x\ {\isasymequiv}\ t} instead of the puristic \isa{c\ {\isasymequiv}\ {\isasymlambda}\isactrlvec x{\isachardot}\ t}.
|
20542
|
557 |
|
20543
|
558 |
An \emph{overloaded definition} consists of a collection of axioms
|
|
559 |
for the same constant, with zero or one equations \isa{c{\isacharparenleft}{\isacharparenleft}\isactrlvec {\isasymalpha}{\isacharparenright}{\isasymkappa}{\isacharparenright}\ {\isasymequiv}\ t} for each type constructor \isa{{\isasymkappa}} (for
|
|
560 |
distinct variables \isa{\isactrlvec {\isasymalpha}}). The RHS may mention
|
|
561 |
previously defined constants as above, or arbitrary constants \isa{d{\isacharparenleft}{\isasymalpha}\isactrlisub i{\isacharparenright}} for some \isa{{\isasymalpha}\isactrlisub i} projected from \isa{\isactrlvec {\isasymalpha}}. Thus overloaded definitions essentially work by
|
|
562 |
primitive recursion over the syntactic structure of a single type
|
|
563 |
argument.%
|
20521
|
564 |
\end{isamarkuptext}%
|
|
565 |
\isamarkuptrue%
|
|
566 |
%
|
|
567 |
\isadelimmlref
|
|
568 |
%
|
|
569 |
\endisadelimmlref
|
|
570 |
%
|
|
571 |
\isatagmlref
|
|
572 |
%
|
|
573 |
\begin{isamarkuptext}%
|
|
574 |
\begin{mldecls}
|
|
575 |
\indexmltype{ctyp}\verb|type ctyp| \\
|
|
576 |
\indexmltype{cterm}\verb|type cterm| \\
|
|
577 |
\indexmltype{thm}\verb|type thm| \\
|
20542
|
578 |
\indexml{proofs}\verb|proofs: int ref| \\
|
|
579 |
\indexml{Thm.ctyp-of}\verb|Thm.ctyp_of: theory -> typ -> ctyp| \\
|
|
580 |
\indexml{Thm.cterm-of}\verb|Thm.cterm_of: theory -> term -> cterm| \\
|
|
581 |
\indexml{Thm.assume}\verb|Thm.assume: cterm -> thm| \\
|
|
582 |
\indexml{Thm.forall-intr}\verb|Thm.forall_intr: cterm -> thm -> thm| \\
|
|
583 |
\indexml{Thm.forall-elim}\verb|Thm.forall_elim: cterm -> thm -> thm| \\
|
|
584 |
\indexml{Thm.implies-intr}\verb|Thm.implies_intr: cterm -> thm -> thm| \\
|
|
585 |
\indexml{Thm.implies-elim}\verb|Thm.implies_elim: thm -> thm -> thm| \\
|
|
586 |
\indexml{Thm.generalize}\verb|Thm.generalize: string list * string list -> int -> thm -> thm| \\
|
|
587 |
\indexml{Thm.instantiate}\verb|Thm.instantiate: (ctyp * ctyp) list * (cterm * cterm) list -> thm -> thm| \\
|
|
588 |
\indexml{Thm.get-axiom-i}\verb|Thm.get_axiom_i: theory -> string -> thm| \\
|
|
589 |
\indexml{Thm.invoke-oracle-i}\verb|Thm.invoke_oracle_i: theory -> string -> theory * Object.T -> thm| \\
|
|
590 |
\indexml{Theory.add-axioms-i}\verb|Theory.add_axioms_i: (string * term) list -> theory -> theory| \\
|
|
591 |
\indexml{Theory.add-deps}\verb|Theory.add_deps: string -> string * typ -> (string * typ) list -> theory -> theory| \\
|
|
592 |
\indexml{Theory.add-oracle}\verb|Theory.add_oracle: string * (theory * Object.T -> term) -> theory -> theory| \\
|
|
593 |
\indexml{Theory.add-defs-i}\verb|Theory.add_defs_i: bool -> bool -> (bstring * term) list -> theory -> theory| \\
|
20521
|
594 |
\end{mldecls}
|
|
595 |
|
|
596 |
\begin{description}
|
|
597 |
|
20542
|
598 |
\item \verb|ctyp| and \verb|cterm| represent certified types
|
|
599 |
and terms, respectively. These are abstract datatypes that
|
|
600 |
guarantee that its values have passed the full well-formedness (and
|
|
601 |
well-typedness) checks, relative to the declarations of type
|
|
602 |
constructors, constants etc. in the theory.
|
|
603 |
|
|
604 |
This representation avoids syntactic rechecking in tight loops of
|
|
605 |
inferences. There are separate operations to decompose certified
|
|
606 |
entities (including actual theorems).
|
|
607 |
|
|
608 |
\item \verb|thm| represents proven propositions. This is an
|
|
609 |
abstract datatype that guarantees that its values have been
|
|
610 |
constructed by basic principles of the \verb|Thm| module.
|
20543
|
611 |
Every \verb|thm| value contains a sliding back-reference to the
|
|
612 |
enclosing theory, cf.\ \secref{sec:context-theory}.
|
20542
|
613 |
|
20543
|
614 |
\item \verb|proofs| determines the detail of proof recording within
|
|
615 |
\verb|thm| values: \verb|0| records only oracles, \verb|1| records
|
|
616 |
oracles, axioms and named theorems, \verb|2| records full proof
|
|
617 |
terms.
|
20542
|
618 |
|
|
619 |
\item \verb|Thm.assume|, \verb|Thm.forall_intr|, \verb|Thm.forall_elim|, \verb|Thm.implies_intr|, and \verb|Thm.implies_elim|
|
|
620 |
correspond to the primitive inferences of \figref{fig:prim-rules}.
|
|
621 |
|
|
622 |
\item \verb|Thm.generalize|~\isa{{\isacharparenleft}\isactrlvec {\isasymalpha}{\isacharcomma}\ \isactrlvec x{\isacharparenright}}
|
|
623 |
corresponds to the \isa{generalize} rules of
|
20543
|
624 |
\figref{fig:subst-rules}. Here collections of type and term
|
|
625 |
variables are generalized simultaneously, specified by the given
|
|
626 |
basic names.
|
20499
|
627 |
|
20542
|
628 |
\item \verb|Thm.instantiate|~\isa{{\isacharparenleft}\isactrlvec {\isasymalpha}\isactrlisub s{\isacharcomma}\ \isactrlvec x\isactrlisub {\isasymtau}{\isacharparenright}} corresponds to the \isa{instantiate} rules
|
|
629 |
of \figref{fig:subst-rules}. Type variables are substituted before
|
|
630 |
term variables. Note that the types in \isa{\isactrlvec x\isactrlisub {\isasymtau}}
|
|
631 |
refer to the instantiated versions.
|
|
632 |
|
|
633 |
\item \verb|Thm.get_axiom_i|~\isa{thy\ name} retrieves a named
|
|
634 |
axiom, cf.\ \isa{axiom} in \figref{fig:prim-rules}.
|
20521
|
635 |
|
20543
|
636 |
\item \verb|Thm.invoke_oracle_i|~\isa{thy\ name\ arg} invokes a
|
|
637 |
named oracle function, cf.\ \isa{axiom} in
|
|
638 |
\figref{fig:prim-rules}.
|
20542
|
639 |
|
20543
|
640 |
\item \verb|Theory.add_axioms_i|~\isa{{\isacharbrackleft}{\isacharparenleft}name{\isacharcomma}\ A{\isacharparenright}{\isacharcomma}\ {\isasymdots}{\isacharbrackright}} declares
|
|
641 |
arbitrary propositions as axioms.
|
20542
|
642 |
|
20543
|
643 |
\item \verb|Theory.add_oracle|~\isa{{\isacharparenleft}name{\isacharcomma}\ f{\isacharparenright}} declares an oracle
|
|
644 |
function for generating arbitrary axioms on the fly.
|
20542
|
645 |
|
20543
|
646 |
\item \verb|Theory.add_deps|~\isa{name\ c\isactrlisub {\isasymtau}\ \isactrlvec d\isactrlisub {\isasymsigma}} declares dependencies of a named specification
|
|
647 |
for constant \isa{c\isactrlisub {\isasymtau}}, relative to existing
|
|
648 |
specifications for constants \isa{\isactrlvec d\isactrlisub {\isasymsigma}}.
|
20542
|
649 |
|
20543
|
650 |
\item \verb|Theory.add_defs_i|~\isa{unchecked\ overloaded\ {\isacharbrackleft}{\isacharparenleft}name{\isacharcomma}\ c\ \isactrlvec x\ {\isasymequiv}\ t{\isacharparenright}{\isacharcomma}\ {\isasymdots}{\isacharbrackright}} states a definitional axiom for an existing
|
|
651 |
constant \isa{c}. Dependencies are recorded (cf.\ \verb|Theory.add_deps|), unless the \isa{unchecked} option is set.
|
20521
|
652 |
|
|
653 |
\end{description}%
|
|
654 |
\end{isamarkuptext}%
|
|
655 |
\isamarkuptrue%
|
|
656 |
%
|
|
657 |
\endisatagmlref
|
|
658 |
{\isafoldmlref}%
|
|
659 |
%
|
|
660 |
\isadelimmlref
|
|
661 |
%
|
|
662 |
\endisadelimmlref
|
|
663 |
%
|
20543
|
664 |
\isamarkupsubsection{Auxiliary definitions%
|
20521
|
665 |
}
|
|
666 |
\isamarkuptrue%
|
|
667 |
%
|
|
668 |
\begin{isamarkuptext}%
|
20543
|
669 |
Theory \isa{Pure} provides a few auxiliary definitions, see
|
|
670 |
\figref{fig:pure-aux}. These special constants are normally not
|
|
671 |
exposed to the user, but appear in internal encodings.
|
20502
|
672 |
|
|
673 |
\begin{figure}[htb]
|
|
674 |
\begin{center}
|
20499
|
675 |
\begin{tabular}{ll}
|
20521
|
676 |
\isa{conjunction\ {\isacharcolon}{\isacharcolon}\ prop\ {\isasymRightarrow}\ prop\ {\isasymRightarrow}\ prop} & (infix \isa{{\isacharampersand}}) \\
|
|
677 |
\isa{{\isasymturnstile}\ A\ {\isacharampersand}\ B\ {\isasymequiv}\ {\isacharparenleft}{\isasymAnd}C{\isachardot}\ {\isacharparenleft}A\ {\isasymLongrightarrow}\ B\ {\isasymLongrightarrow}\ C{\isacharparenright}\ {\isasymLongrightarrow}\ C{\isacharparenright}} \\[1ex]
|
20543
|
678 |
\isa{prop\ {\isacharcolon}{\isacharcolon}\ prop\ {\isasymRightarrow}\ prop} & (prefix \isa{{\isacharhash}}, suppressed) \\
|
20521
|
679 |
\isa{{\isacharhash}A\ {\isasymequiv}\ A} \\[1ex]
|
|
680 |
\isa{term\ {\isacharcolon}{\isacharcolon}\ {\isasymalpha}\ {\isasymRightarrow}\ prop} & (prefix \isa{TERM}) \\
|
|
681 |
\isa{term\ x\ {\isasymequiv}\ {\isacharparenleft}{\isasymAnd}A{\isachardot}\ A\ {\isasymLongrightarrow}\ A{\isacharparenright}} \\[1ex]
|
|
682 |
\isa{TYPE\ {\isacharcolon}{\isacharcolon}\ {\isasymalpha}\ itself} & (prefix \isa{TYPE}) \\
|
|
683 |
\isa{{\isacharparenleft}unspecified{\isacharparenright}} \\
|
20499
|
684 |
\end{tabular}
|
20521
|
685 |
\caption{Definitions of auxiliary connectives}\label{fig:pure-aux}
|
20502
|
686 |
\end{center}
|
|
687 |
\end{figure}
|
|
688 |
|
20537
|
689 |
Derived conjunction rules include introduction \isa{A\ {\isasymLongrightarrow}\ B\ {\isasymLongrightarrow}\ A\ {\isacharampersand}\ B}, and destructions \isa{A\ {\isacharampersand}\ B\ {\isasymLongrightarrow}\ A} and \isa{A\ {\isacharampersand}\ B\ {\isasymLongrightarrow}\ B}.
|
|
690 |
Conjunction allows to treat simultaneous assumptions and conclusions
|
|
691 |
uniformly. For example, multiple claims are intermediately
|
20543
|
692 |
represented as explicit conjunction, but this is refined into
|
|
693 |
separate sub-goals before the user continues the proof; the final
|
|
694 |
result is projected into a list of theorems (cf.\
|
20537
|
695 |
\secref{sec:tactical-goals}).
|
20502
|
696 |
|
20537
|
697 |
The \isa{prop} marker (\isa{{\isacharhash}}) makes arbitrarily complex
|
|
698 |
propositions appear as atomic, without changing the meaning: \isa{{\isasymGamma}\ {\isasymturnstile}\ A} and \isa{{\isasymGamma}\ {\isasymturnstile}\ {\isacharhash}A} are interchangeable. See
|
|
699 |
\secref{sec:tactical-goals} for specific operations.
|
20502
|
700 |
|
20543
|
701 |
The \isa{term} marker turns any well-typed term into a derivable
|
|
702 |
proposition: \isa{{\isasymturnstile}\ TERM\ t} holds unconditionally. Although
|
|
703 |
this is logically vacuous, it allows to treat terms and proofs
|
|
704 |
uniformly, similar to a type-theoretic framework.
|
20502
|
705 |
|
20537
|
706 |
The \isa{TYPE} constructor is the canonical representative of
|
|
707 |
the unspecified type \isa{{\isasymalpha}\ itself}; it essentially injects the
|
|
708 |
language of types into that of terms. There is specific notation
|
|
709 |
\isa{TYPE{\isacharparenleft}{\isasymtau}{\isacharparenright}} for \isa{TYPE\isactrlbsub {\isasymtau}\ itself\isactrlesub }.
|
|
710 |
Although being devoid of any particular meaning, the \isa{TYPE{\isacharparenleft}{\isasymtau}{\isacharparenright}} accounts for the type \isa{{\isasymtau}} within the term
|
|
711 |
language. In particular, \isa{TYPE{\isacharparenleft}{\isasymalpha}{\isacharparenright}} may be used as formal
|
|
712 |
argument in primitive definitions, in order to circumvent hidden
|
|
713 |
polymorphism (cf.\ \secref{sec:terms}). For example, \isa{c\ TYPE{\isacharparenleft}{\isasymalpha}{\isacharparenright}\ {\isasymequiv}\ A{\isacharbrackleft}{\isasymalpha}{\isacharbrackright}} defines \isa{c\ {\isacharcolon}{\isacharcolon}\ {\isasymalpha}\ itself\ {\isasymRightarrow}\ prop} in terms of
|
|
714 |
a proposition \isa{A} that depends on an additional type
|
|
715 |
argument, which is essentially a predicate on types.%
|
18537
|
716 |
\end{isamarkuptext}%
|
|
717 |
\isamarkuptrue%
|
|
718 |
%
|
20521
|
719 |
\isadelimmlref
|
|
720 |
%
|
|
721 |
\endisadelimmlref
|
|
722 |
%
|
|
723 |
\isatagmlref
|
|
724 |
%
|
|
725 |
\begin{isamarkuptext}%
|
|
726 |
\begin{mldecls}
|
|
727 |
\indexml{Conjunction.intr}\verb|Conjunction.intr: thm -> thm -> thm| \\
|
|
728 |
\indexml{Conjunction.elim}\verb|Conjunction.elim: thm -> thm * thm| \\
|
|
729 |
\indexml{Drule.mk-term}\verb|Drule.mk_term: cterm -> thm| \\
|
|
730 |
\indexml{Drule.dest-term}\verb|Drule.dest_term: thm -> cterm| \\
|
|
731 |
\indexml{Logic.mk-type}\verb|Logic.mk_type: typ -> term| \\
|
|
732 |
\indexml{Logic.dest-type}\verb|Logic.dest_type: term -> typ| \\
|
|
733 |
\end{mldecls}
|
|
734 |
|
|
735 |
\begin{description}
|
|
736 |
|
20542
|
737 |
\item \verb|Conjunction.intr| derives \isa{A\ {\isacharampersand}\ B} from \isa{A} and \isa{B}.
|
|
738 |
|
20543
|
739 |
\item \verb|Conjunction.elim| derives \isa{A} and \isa{B}
|
20542
|
740 |
from \isa{A\ {\isacharampersand}\ B}.
|
|
741 |
|
20543
|
742 |
\item \verb|Drule.mk_term| derives \isa{TERM\ t}.
|
20542
|
743 |
|
20543
|
744 |
\item \verb|Drule.dest_term| recovers term \isa{t} from \isa{TERM\ t}.
|
20542
|
745 |
|
|
746 |
\item \verb|Logic.mk_type|~\isa{{\isasymtau}} produces the term \isa{TYPE{\isacharparenleft}{\isasymtau}{\isacharparenright}}.
|
|
747 |
|
|
748 |
\item \verb|Logic.dest_type|~\isa{TYPE{\isacharparenleft}{\isasymtau}{\isacharparenright}} recovers the type
|
|
749 |
\isa{{\isasymtau}}.
|
20521
|
750 |
|
|
751 |
\end{description}%
|
|
752 |
\end{isamarkuptext}%
|
|
753 |
\isamarkuptrue%
|
|
754 |
%
|
|
755 |
\endisatagmlref
|
|
756 |
{\isafoldmlref}%
|
|
757 |
%
|
|
758 |
\isadelimmlref
|
|
759 |
%
|
|
760 |
\endisadelimmlref
|
|
761 |
%
|
20491
|
762 |
\isamarkupsection{Rules \label{sec:rules}%
|
18537
|
763 |
}
|
|
764 |
\isamarkuptrue%
|
|
765 |
%
|
|
766 |
\begin{isamarkuptext}%
|
|
767 |
FIXME
|
|
768 |
|
20491
|
769 |
A \emph{rule} is any Pure theorem in HHF normal form; there is a
|
|
770 |
separate calculus for rule composition, which is modeled after
|
|
771 |
Gentzen's Natural Deduction \cite{Gentzen:1935}, but allows
|
|
772 |
rules to be nested arbitrarily, similar to \cite{extensions91}.
|
|
773 |
|
|
774 |
Normally, all theorems accessible to the user are proper rules.
|
|
775 |
Low-level inferences are occasional required internally, but the
|
|
776 |
result should be always presented in canonical form. The higher
|
|
777 |
interfaces of Isabelle/Isar will always produce proper rules. It is
|
|
778 |
important to maintain this invariant in add-on applications!
|
|
779 |
|
|
780 |
There are two main principles of rule composition: \isa{resolution} (i.e.\ backchaining of rules) and \isa{by{\isacharminus}assumption} (i.e.\ closing a branch); both principles are
|
20519
|
781 |
combined in the variants of \isa{elim{\isacharminus}resolution} and \isa{dest{\isacharminus}resolution}. Raw \isa{composition} is occasionally
|
20491
|
782 |
useful as well, also it is strictly speaking outside of the proper
|
|
783 |
rule calculus.
|
|
784 |
|
|
785 |
Rules are treated modulo general higher-order unification, which is
|
|
786 |
unification modulo the equational theory of \isa{{\isasymalpha}{\isasymbeta}{\isasymeta}}-conversion
|
|
787 |
on \isa{{\isasymlambda}}-terms. Moreover, propositions are understood modulo
|
|
788 |
the (derived) equivalence \isa{{\isacharparenleft}A\ {\isasymLongrightarrow}\ {\isacharparenleft}{\isasymAnd}x{\isachardot}\ B\ x{\isacharparenright}{\isacharparenright}\ {\isasymequiv}\ {\isacharparenleft}{\isasymAnd}x{\isachardot}\ A\ {\isasymLongrightarrow}\ B\ x{\isacharparenright}}.
|
|
789 |
|
|
790 |
This means that any operations within the rule calculus may be
|
|
791 |
subject to spontaneous \isa{{\isasymalpha}{\isasymbeta}{\isasymeta}}-HHF conversions. It is common
|
|
792 |
practice not to contract or expand unnecessarily. Some mechanisms
|
|
793 |
prefer an one form, others the opposite, so there is a potential
|
|
794 |
danger to produce some oscillation!
|
|
795 |
|
|
796 |
Only few operations really work \emph{modulo} HHF conversion, but
|
|
797 |
expect a normal form: quantifiers \isa{{\isasymAnd}} before implications
|
|
798 |
\isa{{\isasymLongrightarrow}} at each level of nesting.
|
|
799 |
|
18537
|
800 |
\glossary{Hereditary Harrop Formula}{The set of propositions in HHF
|
|
801 |
format is defined inductively as \isa{H\ {\isacharequal}\ {\isacharparenleft}{\isasymAnd}x\isactrlsup {\isacharasterisk}{\isachardot}\ H\isactrlsup {\isacharasterisk}\ {\isasymLongrightarrow}\ A{\isacharparenright}}, for variables \isa{x} and atomic propositions \isa{A}.
|
|
802 |
Any proposition may be put into HHF form by normalizing with the rule
|
|
803 |
\isa{{\isacharparenleft}A\ {\isasymLongrightarrow}\ {\isacharparenleft}{\isasymAnd}x{\isachardot}\ B\ x{\isacharparenright}{\isacharparenright}\ {\isasymequiv}\ {\isacharparenleft}{\isasymAnd}x{\isachardot}\ A\ {\isasymLongrightarrow}\ B\ x{\isacharparenright}}. In Isabelle, the outermost
|
|
804 |
quantifier prefix is represented via \seeglossary{schematic
|
|
805 |
variables}, such that the top-level structure is merely that of a
|
|
806 |
\seeglossary{Horn Clause}}.
|
|
807 |
|
20499
|
808 |
\glossary{HHF}{See \seeglossary{Hereditary Harrop Formula}.}
|
|
809 |
|
|
810 |
|
|
811 |
\[
|
|
812 |
\infer[\isa{{\isacharparenleft}assumption{\isacharparenright}}]{\isa{C{\isasymvartheta}}}
|
|
813 |
{\isa{{\isacharparenleft}{\isasymAnd}\isactrlvec x{\isachardot}\ \isactrlvec H\ \isactrlvec x\ {\isasymLongrightarrow}\ A\ \isactrlvec x{\isacharparenright}\ {\isasymLongrightarrow}\ C} & \isa{A{\isasymvartheta}\ {\isacharequal}\ H\isactrlsub i{\isasymvartheta}}~~\text{(for some~\isa{i})}}
|
|
814 |
\]
|
|
815 |
|
|
816 |
|
|
817 |
\[
|
|
818 |
\infer[\isa{{\isacharparenleft}compose{\isacharparenright}}]{\isa{\isactrlvec A{\isasymvartheta}\ {\isasymLongrightarrow}\ C{\isasymvartheta}}}
|
|
819 |
{\isa{\isactrlvec A\ {\isasymLongrightarrow}\ B} & \isa{B{\isacharprime}\ {\isasymLongrightarrow}\ C} & \isa{B{\isasymvartheta}\ {\isacharequal}\ B{\isacharprime}{\isasymvartheta}}}
|
|
820 |
\]
|
|
821 |
|
|
822 |
|
|
823 |
\[
|
|
824 |
\infer[\isa{{\isacharparenleft}{\isasymAnd}{\isacharunderscore}lift{\isacharparenright}}]{\isa{{\isacharparenleft}{\isasymAnd}\isactrlvec x{\isachardot}\ \isactrlvec A\ {\isacharparenleft}{\isacharquery}\isactrlvec a\ \isactrlvec x{\isacharparenright}{\isacharparenright}\ {\isasymLongrightarrow}\ {\isacharparenleft}{\isasymAnd}\isactrlvec x{\isachardot}\ B\ {\isacharparenleft}{\isacharquery}\isactrlvec a\ \isactrlvec x{\isacharparenright}{\isacharparenright}}}{\isa{\isactrlvec A\ {\isacharquery}\isactrlvec a\ {\isasymLongrightarrow}\ B\ {\isacharquery}\isactrlvec a}}
|
|
825 |
\]
|
|
826 |
\[
|
|
827 |
\infer[\isa{{\isacharparenleft}{\isasymLongrightarrow}{\isacharunderscore}lift{\isacharparenright}}]{\isa{{\isacharparenleft}\isactrlvec H\ {\isasymLongrightarrow}\ \isactrlvec A{\isacharparenright}\ {\isasymLongrightarrow}\ {\isacharparenleft}\isactrlvec H\ {\isasymLongrightarrow}\ B{\isacharparenright}}}{\isa{\isactrlvec A\ {\isasymLongrightarrow}\ B}}
|
|
828 |
\]
|
|
829 |
|
|
830 |
The \isa{resolve} scheme is now acquired from \isa{{\isasymAnd}{\isacharunderscore}lift},
|
|
831 |
\isa{{\isasymLongrightarrow}{\isacharunderscore}lift}, and \isa{compose}.
|
|
832 |
|
|
833 |
\[
|
|
834 |
\infer[\isa{{\isacharparenleft}resolution{\isacharparenright}}]
|
|
835 |
{\isa{{\isacharparenleft}{\isasymAnd}\isactrlvec x{\isachardot}\ \isactrlvec H\ \isactrlvec x\ {\isasymLongrightarrow}\ \isactrlvec A\ {\isacharparenleft}{\isacharquery}\isactrlvec a\ \isactrlvec x{\isacharparenright}{\isacharparenright}{\isasymvartheta}\ {\isasymLongrightarrow}\ C{\isasymvartheta}}}
|
|
836 |
{\begin{tabular}{l}
|
|
837 |
\isa{\isactrlvec A\ {\isacharquery}\isactrlvec a\ {\isasymLongrightarrow}\ B\ {\isacharquery}\isactrlvec a} \\
|
|
838 |
\isa{{\isacharparenleft}{\isasymAnd}\isactrlvec x{\isachardot}\ \isactrlvec H\ \isactrlvec x\ {\isasymLongrightarrow}\ B{\isacharprime}\ \isactrlvec x{\isacharparenright}\ {\isasymLongrightarrow}\ C} \\
|
|
839 |
\isa{{\isacharparenleft}{\isasymlambda}\isactrlvec x{\isachardot}\ B\ {\isacharparenleft}{\isacharquery}\isactrlvec a\ \isactrlvec x{\isacharparenright}{\isacharparenright}{\isasymvartheta}\ {\isacharequal}\ B{\isacharprime}{\isasymvartheta}} \\
|
|
840 |
\end{tabular}}
|
|
841 |
\]
|
|
842 |
|
|
843 |
|
|
844 |
FIXME \isa{elim{\isacharunderscore}resolution}, \isa{dest{\isacharunderscore}resolution}%
|
18537
|
845 |
\end{isamarkuptext}%
|
|
846 |
\isamarkuptrue%
|
|
847 |
%
|
|
848 |
\isadelimtheory
|
|
849 |
%
|
|
850 |
\endisadelimtheory
|
|
851 |
%
|
|
852 |
\isatagtheory
|
|
853 |
\isacommand{end}\isamarkupfalse%
|
|
854 |
%
|
|
855 |
\endisatagtheory
|
|
856 |
{\isafoldtheory}%
|
|
857 |
%
|
|
858 |
\isadelimtheory
|
|
859 |
%
|
|
860 |
\endisadelimtheory
|
|
861 |
\isanewline
|
|
862 |
\end{isabellebody}%
|
|
863 |
%%% Local Variables:
|
|
864 |
%%% mode: latex
|
|
865 |
%%% TeX-master: "root"
|
|
866 |
%%% End:
|