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
|
|
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
|
|
36 |
\isa{{\isasymLongrightarrow}} for implication (proofs depending on proofs).
|
|
37 |
|
|
38 |
Pure derivations are relative to a logical theory, which declares
|
20491
|
39 |
type constructors, term constants, and axioms. Theory declarations
|
|
40 |
support schematic polymorphism, which is strictly speaking outside
|
|
41 |
the logic.\footnote{Incidently, this is the main logical reason, why
|
|
42 |
the theory context \isa{{\isasymTheta}} is separate from the context \isa{{\isasymGamma}} of the core calculus.}%
|
20481
|
43 |
\end{isamarkuptext}%
|
|
44 |
\isamarkuptrue%
|
|
45 |
%
|
20451
|
46 |
\isamarkupsection{Types \label{sec:types}%
|
18537
|
47 |
}
|
|
48 |
\isamarkuptrue%
|
|
49 |
%
|
|
50 |
\begin{isamarkuptext}%
|
20481
|
51 |
The language of types is an uninterpreted order-sorted first-order
|
|
52 |
algebra; types are qualified by ordered type classes.
|
20451
|
53 |
|
20481
|
54 |
\medskip A \emph{type class} is an abstract syntactic entity
|
|
55 |
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
|
56 |
generating relation; the transitive closure is maintained
|
|
57 |
internally. The resulting relation is an ordering: reflexive,
|
|
58 |
transitive, and antisymmetric.
|
20451
|
59 |
|
20481
|
60 |
A \emph{sort} is a list of type classes written as \isa{{\isacharbraceleft}c\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ c\isactrlisub m{\isacharbraceright}}, which represents symbolic
|
|
61 |
intersection. Notationally, the curly braces are omitted for
|
|
62 |
singleton intersections, i.e.\ any class \isa{c} may be read as
|
|
63 |
a sort \isa{{\isacharbraceleft}c{\isacharbraceright}}. The ordering on type classes is extended to
|
20491
|
64 |
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
|
|
65 |
\isa{{\isasymforall}j{\isachardot}\ {\isasymexists}i{\isachardot}\ c\isactrlisub i\ {\isasymsubseteq}\ d\isactrlisub j}. The empty intersection
|
|
66 |
\isa{{\isacharbraceleft}{\isacharbraceright}} refers to the universal sort, which is the largest
|
|
67 |
element wrt.\ the sort order. The intersections of all (finitely
|
|
68 |
many) classes declared in the current theory are the minimal
|
|
69 |
elements wrt.\ the sort order.
|
20451
|
70 |
|
20491
|
71 |
\medskip A \emph{fixed type variable} is a pair of a basic name
|
20493
|
72 |
(starting with a \isa{{\isacharprime}} character) and a sort constraint. For
|
20481
|
73 |
example, \isa{{\isacharparenleft}{\isacharprime}a{\isacharcomma}\ s{\isacharparenright}} which is usually printed as \isa{{\isasymalpha}\isactrlisub s}. A \emph{schematic type variable} is a pair of an
|
20491
|
74 |
indexname and a sort constraint. For example, \isa{{\isacharparenleft}{\isacharparenleft}{\isacharprime}a{\isacharcomma}\ {\isadigit{0}}{\isacharparenright}{\isacharcomma}\ s{\isacharparenright}} which is usually printed as \isa{{\isacharquery}{\isasymalpha}\isactrlisub s}.
|
20481
|
75 |
|
|
76 |
Note that \emph{all} syntactic components contribute to the identity
|
20493
|
77 |
of type variables, including the sort constraint. The core logic
|
|
78 |
handles type variables with the same name but different sorts as
|
|
79 |
different, although some outer layers of the system make it hard to
|
|
80 |
produce anything like this.
|
18537
|
81 |
|
20493
|
82 |
A \emph{type constructor} \isa{{\isasymkappa}} is a \isa{k}-ary operator
|
|
83 |
on types declared in the theory. Type constructor application is
|
20494
|
84 |
usually written postfix as \isa{{\isacharparenleft}{\isasymalpha}\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ {\isasymalpha}\isactrlisub k{\isacharparenright}{\isasymkappa}}.
|
|
85 |
For \isa{k\ {\isacharequal}\ {\isadigit{0}}} the argument tuple is omitted, e.g.\ \isa{prop} instead of \isa{{\isacharparenleft}{\isacharparenright}prop}. For \isa{k\ {\isacharequal}\ {\isadigit{1}}} the
|
|
86 |
parentheses are omitted, e.g.\ \isa{{\isasymalpha}\ list} instead of \isa{{\isacharparenleft}{\isasymalpha}{\isacharparenright}list}. Further notation is provided for specific constructors,
|
|
87 |
notably the right-associative infix \isa{{\isasymalpha}\ {\isasymRightarrow}\ {\isasymbeta}} instead of
|
|
88 |
\isa{{\isacharparenleft}{\isasymalpha}{\isacharcomma}\ {\isasymbeta}{\isacharparenright}fun}.
|
20481
|
89 |
|
20514
|
90 |
A \emph{type} \isa{{\isasymtau}} is defined inductively over type variables
|
|
91 |
and type 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}k}.
|
20451
|
92 |
|
20514
|
93 |
A \emph{type abbreviation} is a syntactic definition \isa{{\isacharparenleft}\isactrlvec {\isasymalpha}{\isacharparenright}{\isasymkappa}\ {\isacharequal}\ {\isasymtau}} of an arbitrary type expression \isa{{\isasymtau}} over
|
20494
|
94 |
variables \isa{\isactrlvec {\isasymalpha}}. Type abbreviations looks like type
|
|
95 |
constructors at the surface, but are fully expanded before entering
|
|
96 |
the logical core.
|
20451
|
97 |
|
20481
|
98 |
A \emph{type arity} declares the image behavior of a type
|
20494
|
99 |
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
|
|
100 |
of sort \isa{s} if every argument type \isa{{\isasymtau}\isactrlisub i} is
|
|
101 |
of sort \isa{s\isactrlisub i}. Arity declarations are implicitly
|
|
102 |
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
|
103 |
|
20491
|
104 |
\medskip The sort algebra is always maintained as \emph{coregular},
|
|
105 |
which means that type arities are consistent with the subclass
|
20519
|
106 |
relation: for each type constructor \isa{{\isasymkappa}} and classes \isa{c\isactrlisub {\isadigit{1}}\ {\isasymsubseteq}\ c\isactrlisub {\isadigit{2}}}, any arity \isa{{\isasymkappa}\ {\isacharcolon}{\isacharcolon}\ {\isacharparenleft}\isactrlvec s\isactrlisub {\isadigit{1}}{\isacharparenright}c\isactrlisub {\isadigit{1}}} has a corresponding arity \isa{{\isasymkappa}\ {\isacharcolon}{\isacharcolon}\ {\isacharparenleft}\isactrlvec s\isactrlisub {\isadigit{2}}{\isacharparenright}c\isactrlisub {\isadigit{2}}} where \isa{\isactrlvec s\isactrlisub {\isadigit{1}}\ {\isasymsubseteq}\ \isactrlvec s\isactrlisub {\isadigit{2}}} holds component-wise.
|
20491
|
107 |
|
|
108 |
The key property of a coregular order-sorted algebra is that sort
|
20494
|
109 |
constraints may be always solved in a most general fashion: for each
|
|
110 |
type constructor \isa{{\isasymkappa}} and sort \isa{s} there is a most
|
|
111 |
general vector of argument sorts \isa{{\isacharparenleft}s\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ s\isactrlisub k{\isacharparenright}} such 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
|
20491
|
112 |
of sort \isa{s}. Consequently, the unification problem on the
|
|
113 |
algebra of types has most general solutions (modulo renaming and
|
|
114 |
equivalence of sorts). Moreover, the usual type-inference algorithm
|
|
115 |
will produce primary types as expected \cite{nipkow-prehofer}.%
|
18537
|
116 |
\end{isamarkuptext}%
|
|
117 |
\isamarkuptrue%
|
|
118 |
%
|
20481
|
119 |
\isadelimmlref
|
|
120 |
%
|
|
121 |
\endisadelimmlref
|
|
122 |
%
|
|
123 |
\isatagmlref
|
|
124 |
%
|
|
125 |
\begin{isamarkuptext}%
|
|
126 |
\begin{mldecls}
|
|
127 |
\indexmltype{class}\verb|type class| \\
|
|
128 |
\indexmltype{sort}\verb|type sort| \\
|
20494
|
129 |
\indexmltype{arity}\verb|type arity| \\
|
20481
|
130 |
\indexmltype{typ}\verb|type typ| \\
|
20519
|
131 |
\indexml{map-atyps}\verb|map_atyps: (typ -> typ) -> typ -> typ| \\
|
20494
|
132 |
\indexml{fold-atyps}\verb|fold_atyps: (typ -> 'a -> 'a) -> typ -> 'a -> 'a| \\
|
20481
|
133 |
\indexml{Sign.subsort}\verb|Sign.subsort: theory -> sort * sort -> bool| \\
|
|
134 |
\indexml{Sign.of-sort}\verb|Sign.of_sort: theory -> typ * sort -> bool| \\
|
20520
|
135 |
\indexml{Sign.add-types}\verb|Sign.add_types: (string * int * mixfix) list -> theory -> theory| \\
|
20481
|
136 |
\indexml{Sign.add-tyabbrs-i}\verb|Sign.add_tyabbrs_i: |\isasep\isanewline%
|
20520
|
137 |
\verb| (string * string list * typ * mixfix) list -> theory -> theory| \\
|
20481
|
138 |
\indexml{Sign.primitive-class}\verb|Sign.primitive_class: string * class list -> theory -> theory| \\
|
|
139 |
\indexml{Sign.primitive-classrel}\verb|Sign.primitive_classrel: class * class -> theory -> theory| \\
|
|
140 |
\indexml{Sign.primitive-arity}\verb|Sign.primitive_arity: arity -> theory -> theory| \\
|
|
141 |
\end{mldecls}
|
|
142 |
|
|
143 |
\begin{description}
|
|
144 |
|
|
145 |
\item \verb|class| represents type classes; this is an alias for
|
|
146 |
\verb|string|.
|
|
147 |
|
|
148 |
\item \verb|sort| represents sorts; this is an alias for
|
|
149 |
\verb|class list|.
|
|
150 |
|
|
151 |
\item \verb|arity| represents type arities; this is an alias for
|
20494
|
152 |
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
|
153 |
|
|
154 |
\item \verb|typ| represents types; this is a datatype with
|
|
155 |
constructors \verb|TFree|, \verb|TVar|, \verb|Type|.
|
|
156 |
|
20519
|
157 |
\item \verb|map_atyps|~\isa{f\ {\isasymtau}} applies mapping \isa{f} to
|
|
158 |
all atomic types (\verb|TFree|, \verb|TVar|) occurring in \isa{{\isasymtau}}.
|
|
159 |
|
|
160 |
\item \verb|fold_atyps|~\isa{f\ {\isasymtau}} iterates operation \isa{f}
|
|
161 |
over all occurrences of atoms (\verb|TFree|, \verb|TVar|) in \isa{{\isasymtau}}; the type structure is traversed from left to right.
|
20494
|
162 |
|
20481
|
163 |
\item \verb|Sign.subsort|~\isa{thy\ {\isacharparenleft}s\isactrlisub {\isadigit{1}}{\isacharcomma}\ s\isactrlisub {\isadigit{2}}{\isacharparenright}}
|
|
164 |
tests the subsort relation \isa{s\isactrlisub {\isadigit{1}}\ {\isasymsubseteq}\ s\isactrlisub {\isadigit{2}}}.
|
|
165 |
|
|
166 |
\item \verb|Sign.of_sort|~\isa{thy\ {\isacharparenleft}{\isasymtau}{\isacharcomma}\ s{\isacharparenright}} tests whether a type
|
20491
|
167 |
is of a given sort.
|
20481
|
168 |
|
20494
|
169 |
\item \verb|Sign.add_types|~\isa{{\isacharbrackleft}{\isacharparenleft}{\isasymkappa}{\isacharcomma}\ k{\isacharcomma}\ mx{\isacharparenright}{\isacharcomma}\ {\isasymdots}{\isacharbrackright}} declares new
|
|
170 |
type constructors \isa{{\isasymkappa}} with \isa{k} arguments and
|
20481
|
171 |
optional mixfix syntax.
|
|
172 |
|
20494
|
173 |
\item \verb|Sign.add_tyabbrs_i|~\isa{{\isacharbrackleft}{\isacharparenleft}{\isasymkappa}{\isacharcomma}\ \isactrlvec {\isasymalpha}{\isacharcomma}\ {\isasymtau}{\isacharcomma}\ mx{\isacharparenright}{\isacharcomma}\ {\isasymdots}{\isacharbrackright}}
|
|
174 |
defines a new type abbreviation \isa{{\isacharparenleft}\isactrlvec {\isasymalpha}{\isacharparenright}{\isasymkappa}\ {\isacharequal}\ {\isasymtau}} with
|
20491
|
175 |
optional mixfix syntax.
|
20481
|
176 |
|
20494
|
177 |
\item \verb|Sign.primitive_class|~\isa{{\isacharparenleft}c{\isacharcomma}\ {\isacharbrackleft}c\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ c\isactrlisub n{\isacharbrackright}{\isacharparenright}} declares new class \isa{c}, together with class
|
|
178 |
relations \isa{c\ {\isasymsubseteq}\ c\isactrlisub i}, for \isa{i\ {\isacharequal}\ {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ n}.
|
20481
|
179 |
|
|
180 |
\item \verb|Sign.primitive_classrel|~\isa{{\isacharparenleft}c\isactrlisub {\isadigit{1}}{\isacharcomma}\ c\isactrlisub {\isadigit{2}}{\isacharparenright}} declares class relation \isa{c\isactrlisub {\isadigit{1}}\ {\isasymsubseteq}\ c\isactrlisub {\isadigit{2}}}.
|
|
181 |
|
20494
|
182 |
\item \verb|Sign.primitive_arity|~\isa{{\isacharparenleft}{\isasymkappa}{\isacharcomma}\ \isactrlvec s{\isacharcomma}\ s{\isacharparenright}} declares
|
|
183 |
arity \isa{{\isasymkappa}\ {\isacharcolon}{\isacharcolon}\ {\isacharparenleft}\isactrlvec s{\isacharparenright}s}.
|
20481
|
184 |
|
|
185 |
\end{description}%
|
|
186 |
\end{isamarkuptext}%
|
|
187 |
\isamarkuptrue%
|
|
188 |
%
|
|
189 |
\endisatagmlref
|
|
190 |
{\isafoldmlref}%
|
|
191 |
%
|
|
192 |
\isadelimmlref
|
|
193 |
%
|
|
194 |
\endisadelimmlref
|
|
195 |
%
|
20451
|
196 |
\isamarkupsection{Terms \label{sec:terms}%
|
18537
|
197 |
}
|
|
198 |
\isamarkuptrue%
|
|
199 |
%
|
|
200 |
\begin{isamarkuptext}%
|
20451
|
201 |
\glossary{Term}{FIXME}
|
18537
|
202 |
|
20491
|
203 |
The language of terms is that of simply-typed \isa{{\isasymlambda}}-calculus
|
20520
|
204 |
with de-Bruijn indices for bound variables (cf.\ \cite{debruijn72}
|
|
205 |
or \cite{paulson-ml2}), and named free variables and constants.
|
|
206 |
Terms with loose bound variables are usually considered malformed.
|
|
207 |
The types of variables and constants is stored explicitly at each
|
|
208 |
occurrence in the term.
|
20514
|
209 |
|
|
210 |
\medskip A \emph{bound variable} is a natural number \isa{b},
|
|
211 |
which refers to the next binder that is \isa{b} steps upwards
|
|
212 |
from the occurrence of \isa{b} (counting from zero). Bindings
|
|
213 |
may be introduced as abstractions within the term, or as a separate
|
|
214 |
context (an inside-out list). This associates each bound variable
|
20519
|
215 |
with a type. A \emph{loose variables} is a bound variable that is
|
20514
|
216 |
outside the current scope of local binders or the context. For
|
|
217 |
example, the de-Bruijn term \isa{{\isasymlambda}\isactrlisub {\isasymtau}{\isachardot}\ {\isasymlambda}\isactrlisub {\isasymtau}{\isachardot}\ {\isadigit{1}}\ {\isacharplus}\ {\isadigit{0}}}
|
|
218 |
corresponds to \isa{{\isasymlambda}x\isactrlisub {\isasymtau}{\isachardot}\ {\isasymlambda}y\isactrlisub {\isasymtau}{\isachardot}\ x\ {\isacharplus}\ y} in a named
|
|
219 |
representation. Also note that the very same bound variable may get
|
|
220 |
different numbers at different occurrences.
|
|
221 |
|
|
222 |
A \emph{fixed variable} is a pair of a basic name and a type. For
|
|
223 |
example, \isa{{\isacharparenleft}x{\isacharcomma}\ {\isasymtau}{\isacharparenright}} which is usually printed \isa{x\isactrlisub {\isasymtau}}. A \emph{schematic variable} is a pair of an
|
|
224 |
indexname and a type. For example, \isa{{\isacharparenleft}{\isacharparenleft}x{\isacharcomma}\ {\isadigit{0}}{\isacharparenright}{\isacharcomma}\ {\isasymtau}{\isacharparenright}} which is
|
|
225 |
usually printed as \isa{{\isacharquery}x\isactrlisub {\isasymtau}}.
|
20491
|
226 |
|
20514
|
227 |
\medskip A \emph{constant} is a atomic terms consisting of a basic
|
|
228 |
name and a type. Constants are declared in the context as
|
|
229 |
polymorphic families \isa{c\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}}, meaning that any \isa{c\isactrlisub {\isasymtau}} is a valid constant for all substitution instances
|
|
230 |
\isa{{\isasymtau}\ {\isasymle}\ {\isasymsigma}}.
|
|
231 |
|
|
232 |
The list of \emph{type arguments} of \isa{c\isactrlisub {\isasymtau}} wrt.\ the
|
|
233 |
declaration \isa{c\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}} is the codomain of the type matcher
|
|
234 |
presented in canonical order (according to the left-to-right
|
|
235 |
occurrences of type variables in in \isa{{\isasymsigma}}). Thus \isa{c\isactrlisub {\isasymtau}} can be represented more compactly as \isa{c{\isacharparenleft}{\isasymtau}\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ {\isasymtau}\isactrlisub n{\isacharparenright}}. For example, the instance \isa{plus\isactrlbsub nat\ {\isasymRightarrow}\ nat\ {\isasymRightarrow}\ nat\isactrlesub } of some \isa{plus\ {\isacharcolon}{\isacharcolon}\ {\isasymalpha}\ {\isasymRightarrow}\ {\isasymalpha}\ {\isasymRightarrow}\ {\isasymalpha}} has the singleton list \isa{nat} as type arguments, the
|
|
236 |
constant may be represented as \isa{plus{\isacharparenleft}nat{\isacharparenright}}.
|
20481
|
237 |
|
20514
|
238 |
Constant declarations \isa{c\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}} may contain sort constraints
|
|
239 |
for type variables in \isa{{\isasymsigma}}. These are observed by
|
|
240 |
type-inference as expected, but \emph{ignored} by the core logic.
|
|
241 |
This means the primitive logic is able to reason with instances of
|
|
242 |
polymorphic constants that the user-level type-checker would reject.
|
20481
|
243 |
|
20514
|
244 |
\medskip A \emph{term} \isa{t} is defined inductively over
|
|
245 |
variables and constants, with abstraction and application as
|
|
246 |
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}}}. Parsing and printing takes
|
|
247 |
care of converting between an external representation with named
|
|
248 |
bound variables. Subsequently, we shall use the latter notation
|
|
249 |
instead of internal de-Bruijn representation.
|
20499
|
250 |
|
20514
|
251 |
The subsequent inductive relation \isa{t\ {\isacharcolon}{\isacharcolon}\ {\isasymtau}} assigns a
|
|
252 |
(unique) type to a term, using the special type constructor \isa{{\isacharparenleft}{\isasymalpha}{\isacharcomma}\ {\isasymbeta}{\isacharparenright}fun}, which is written \isa{{\isasymalpha}\ {\isasymRightarrow}\ {\isasymbeta}}.
|
20499
|
253 |
\[
|
20502
|
254 |
\infer{\isa{a\isactrlisub {\isasymtau}\ {\isacharcolon}{\isacharcolon}\ {\isasymtau}}}{}
|
20499
|
255 |
\qquad
|
20502
|
256 |
\infer{\isa{{\isacharparenleft}{\isasymlambda}x\isactrlsub {\isasymtau}{\isachardot}\ t{\isacharparenright}\ {\isacharcolon}{\isacharcolon}\ {\isasymtau}\ {\isasymRightarrow}\ {\isasymsigma}}}{\isa{t\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}}}
|
|
257 |
\qquad
|
|
258 |
\infer{\isa{t\ u\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}}}{\isa{t\ {\isacharcolon}{\isacharcolon}\ {\isasymtau}\ {\isasymRightarrow}\ {\isasymsigma}} & \isa{u\ {\isacharcolon}{\isacharcolon}\ {\isasymtau}}}
|
20514
|
259 |
\]
|
|
260 |
A \emph{well-typed term} is a term that can be typed according to these rules.
|
|
261 |
|
|
262 |
Typing information can be omitted: type-inference is able to
|
|
263 |
reconstruct the most general type of a raw term, while assigning
|
|
264 |
most general types to all of its variables and constants.
|
|
265 |
Type-inference depends on a context of type constraints for fixed
|
|
266 |
variables, and declarations for polymorphic constants.
|
|
267 |
|
|
268 |
The identity of atomic terms consists both of the name and the type.
|
|
269 |
Thus different entities \isa{c\isactrlbsub {\isasymtau}\isactrlisub {\isadigit{1}}\isactrlesub } and
|
|
270 |
\isa{c\isactrlbsub {\isasymtau}\isactrlisub {\isadigit{2}}\isactrlesub } may well identified by type
|
|
271 |
instantiation, by mapping \isa{{\isasymtau}\isactrlisub {\isadigit{1}}} and \isa{{\isasymtau}\isactrlisub {\isadigit{2}}} to the same \isa{{\isasymtau}}. Although,
|
|
272 |
different type instances of constants of the same basic name are
|
|
273 |
commonplace, this rarely happens for variables: type-inference
|
|
274 |
always demands ``consistent'' type constraints.
|
|
275 |
|
|
276 |
\medskip The \emph{hidden polymorphism} of a term \isa{t\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}}
|
|
277 |
is the set of type variables occurring in \isa{t}, but not in
|
|
278 |
\isa{{\isasymsigma}}. This means that the term implicitly depends on the
|
|
279 |
values of various type variables that are not visible in the overall
|
|
280 |
type, i.e.\ there are different type instances \isa{t{\isasymvartheta}\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}} and \isa{t{\isasymvartheta}{\isacharprime}\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}} with the same type. This
|
|
281 |
slightly pathological situation is apt to cause strange effects.
|
|
282 |
|
|
283 |
\medskip A \emph{term abbreviation} is a syntactic definition \isa{c\isactrlisub {\isasymsigma}\ {\isasymequiv}\ t} of an arbitrary closed term \isa{t} of type
|
|
284 |
\isa{{\isasymsigma}} without any hidden polymorphism. A term abbreviation
|
|
285 |
looks like a constant at the surface, but is fully expanded before
|
|
286 |
entering the logical core. Abbreviations are usually reverted when
|
|
287 |
printing terms, using rules \isa{t\ {\isasymrightarrow}\ c\isactrlisub {\isasymsigma}} has a
|
20519
|
288 |
higher-order term rewrite system.
|
|
289 |
|
|
290 |
\medskip Canonical operations on \isa{{\isasymlambda}}-terms include \isa{{\isasymalpha}{\isasymbeta}{\isasymeta}}-conversion. \isa{{\isasymalpha}}-conversion refers to capture-free
|
|
291 |
renaming of bound variables; \isa{{\isasymbeta}}-conversion contracts an
|
|
292 |
abstraction applied to some argument term, substituting the argument
|
|
293 |
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
|
|
294 |
\isa{{\isadigit{0}}} does not occur in \isa{f}.
|
|
295 |
|
|
296 |
Terms are almost always treated module \isa{{\isasymalpha}}-conversion, which
|
|
297 |
is implicit in the de-Bruijn representation. The names in
|
|
298 |
abstractions of bound variables are maintained only as a comment for
|
|
299 |
parsing and printing. Full \isa{{\isasymalpha}{\isasymbeta}{\isasymeta}}-equivalence is usually
|
|
300 |
taken for granted higher rules (\secref{sec:rules}), anything
|
|
301 |
depending on higher-order unification or rewriting.%
|
18537
|
302 |
\end{isamarkuptext}%
|
|
303 |
\isamarkuptrue%
|
|
304 |
%
|
20514
|
305 |
\isadelimmlref
|
|
306 |
%
|
|
307 |
\endisadelimmlref
|
|
308 |
%
|
|
309 |
\isatagmlref
|
|
310 |
%
|
18537
|
311 |
\begin{isamarkuptext}%
|
20514
|
312 |
\begin{mldecls}
|
|
313 |
\indexmltype{term}\verb|type term| \\
|
20519
|
314 |
\indexml{op aconv}\verb|op aconv: term * term -> bool| \\
|
|
315 |
\indexml{map-term-types}\verb|map_term_types: (typ -> typ) -> term -> term| \\ %FIXME rename map_types
|
|
316 |
\indexml{fold-types}\verb|fold_types: (typ -> 'a -> 'a) -> term -> 'a -> 'a| \\
|
20514
|
317 |
\indexml{map-aterms}\verb|map_aterms: (term -> term) -> term -> term| \\
|
|
318 |
\indexml{fold-aterms}\verb|fold_aterms: (term -> 'a -> 'a) -> term -> 'a -> 'a| \\
|
|
319 |
\indexml{fastype-of}\verb|fastype_of: term -> typ| \\
|
20519
|
320 |
\indexml{lambda}\verb|lambda: term -> term -> term| \\
|
|
321 |
\indexml{betapply}\verb|betapply: term * term -> term| \\
|
20520
|
322 |
\indexml{Sign.add-consts-i}\verb|Sign.add_consts_i: (string * typ * mixfix) list -> theory -> theory| \\
|
20519
|
323 |
\indexml{Sign.add-abbrevs}\verb|Sign.add_abbrevs: string * bool ->|\isasep\isanewline%
|
20520
|
324 |
\verb| ((string * mixfix) * term) list -> theory -> theory| \\
|
20519
|
325 |
\indexml{Sign.const-typargs}\verb|Sign.const_typargs: theory -> string * typ -> typ list| \\
|
|
326 |
\indexml{Sign.const-instance}\verb|Sign.const_instance: theory -> string * typ list -> typ| \\
|
20514
|
327 |
\end{mldecls}
|
18537
|
328 |
|
20514
|
329 |
\begin{description}
|
18537
|
330 |
|
20519
|
331 |
\item \verb|term| represents de-Bruijn terms with comments in
|
|
332 |
abstractions for bound variable names. This is a datatype with
|
|
333 |
constructors \verb|Bound|, \verb|Free|, \verb|Var|, \verb|Const|, \verb|Abs|, \verb|op $|.
|
|
334 |
|
|
335 |
\item \isa{t}~\verb|aconv|~\isa{u} checks \isa{{\isasymalpha}}-equivalence of two terms. This is the basic equality relation
|
|
336 |
on type \verb|term|; raw datatype equality should only be used
|
|
337 |
for operations related to parsing or printing!
|
|
338 |
|
|
339 |
\item \verb|map_term_types|~\isa{f\ t} applies mapping \isa{f}
|
|
340 |
to all types occurring in \isa{t}.
|
|
341 |
|
|
342 |
\item \verb|fold_types|~\isa{f\ t} iterates operation \isa{f}
|
|
343 |
over all occurrences of types in \isa{t}; the term structure is
|
|
344 |
traversed from left to right.
|
|
345 |
|
|
346 |
\item \verb|map_aterms|~\isa{f\ t} applies mapping \isa{f} to
|
|
347 |
all atomic terms (\verb|Bound|, \verb|Free|, \verb|Var|, \verb|Const|)
|
|
348 |
occurring in \isa{t}.
|
|
349 |
|
|
350 |
\item \verb|fold_aterms|~\isa{f\ t} iterates operation \isa{f}
|
|
351 |
over all occurrences of atomic terms in (\verb|Bound|, \verb|Free|,
|
|
352 |
\verb|Var|, \verb|Const|) \isa{t}; the term structure is traversed
|
|
353 |
from left to right.
|
|
354 |
|
|
355 |
\item \verb|fastype_of|~\isa{t} recomputes the type of a
|
|
356 |
well-formed term, while omitting any sanity checks. This operation
|
|
357 |
is relatively slow.
|
|
358 |
|
20520
|
359 |
\item \verb|lambda|~\isa{a\ b} produces an abstraction \isa{{\isasymlambda}a{\isachardot}\ b}, where occurrences of the original (atomic) term \isa{a} in the body \isa{b} are replaced by bound variables.
|
20519
|
360 |
|
20520
|
361 |
\item \verb|betapply|~\isa{t\ u} produces an application \isa{t\ u}, with topmost \isa{{\isasymbeta}}-conversion if \isa{t} happens to
|
|
362 |
be an abstraction.
|
20519
|
363 |
|
|
364 |
\item \verb|Sign.add_consts_i|~\isa{{\isacharbrackleft}{\isacharparenleft}c{\isacharcomma}\ {\isasymsigma}{\isacharcomma}\ mx{\isacharparenright}{\isacharcomma}\ {\isasymdots}{\isacharbrackright}} declares a
|
|
365 |
new constant \isa{c\ {\isacharcolon}{\isacharcolon}\ {\isasymsigma}} with optional mixfix syntax.
|
|
366 |
|
|
367 |
\item \verb|Sign.add_abbrevs|~\isa{print{\isacharunderscore}mode\ {\isacharbrackleft}{\isacharparenleft}{\isacharparenleft}c{\isacharcomma}\ t{\isacharparenright}{\isacharcomma}\ mx{\isacharparenright}{\isacharcomma}\ {\isasymdots}{\isacharbrackright}}
|
|
368 |
declares a new term abbreviation \isa{c\ {\isasymequiv}\ t} with optional
|
|
369 |
mixfix syntax.
|
|
370 |
|
20520
|
371 |
\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}}
|
|
372 |
convert between the two representations of constants, namely full
|
|
373 |
type instance vs.\ compact type arguments form (depending on the
|
|
374 |
most general declaration given in the context).
|
20514
|
375 |
|
|
376 |
\end{description}%
|
18537
|
377 |
\end{isamarkuptext}%
|
|
378 |
\isamarkuptrue%
|
|
379 |
%
|
20514
|
380 |
\endisatagmlref
|
|
381 |
{\isafoldmlref}%
|
|
382 |
%
|
|
383 |
\isadelimmlref
|
|
384 |
%
|
|
385 |
\endisadelimmlref
|
|
386 |
%
|
20451
|
387 |
\isamarkupsection{Theorems \label{sec:thms}%
|
18537
|
388 |
}
|
|
389 |
\isamarkuptrue%
|
|
390 |
%
|
|
391 |
\begin{isamarkuptext}%
|
20502
|
392 |
\glossary{Proposition}{A \seeglossary{term} of \seeglossary{type}
|
|
393 |
\isa{prop}. Internally, there is nothing special about
|
|
394 |
propositions apart from their type, but the concrete syntax enforces
|
|
395 |
a clear distinction. Propositions are structured via implication
|
|
396 |
\isa{A\ {\isasymLongrightarrow}\ B} or universal quantification \isa{{\isasymAnd}x{\isachardot}\ B\ x} ---
|
|
397 |
anything else is considered atomic. The canonical form for
|
|
398 |
propositions is that of a \seeglossary{Hereditary Harrop Formula}. FIXME}
|
20481
|
399 |
|
20502
|
400 |
\glossary{Theorem}{A proven proposition within a certain theory and
|
|
401 |
proof context, formally \isa{{\isasymGamma}\ {\isasymturnstile}\isactrlsub {\isasymTheta}\ {\isasymphi}}; both contexts are
|
|
402 |
rarely spelled out explicitly. Theorems are usually normalized
|
|
403 |
according to the \seeglossary{HHF} format. FIXME}
|
18537
|
404 |
|
20519
|
405 |
\glossary{Fact}{Sometimes used interchangeably for
|
20502
|
406 |
\seeglossary{theorem}. Strictly speaking, a list of theorems,
|
|
407 |
essentially an extra-logical conjunction. Facts emerge either as
|
|
408 |
local assumptions, or as results of local goal statements --- both
|
|
409 |
may be simultaneous, hence the list representation. FIXME}
|
|
410 |
|
|
411 |
\glossary{Schematic variable}{FIXME}
|
|
412 |
|
|
413 |
\glossary{Fixed variable}{A variable that is bound within a certain
|
|
414 |
proof context; an arbitrary-but-fixed entity within a portion of
|
|
415 |
proof text. FIXME}
|
18537
|
416 |
|
20502
|
417 |
\glossary{Free variable}{Synonymous for \seeglossary{fixed
|
|
418 |
variable}. FIXME}
|
|
419 |
|
|
420 |
\glossary{Bound variable}{FIXME}
|
18537
|
421 |
|
20502
|
422 |
\glossary{Variable}{See \seeglossary{schematic variable},
|
|
423 |
\seeglossary{fixed variable}, \seeglossary{bound variable}, or
|
|
424 |
\seeglossary{type variable}. The distinguishing feature of
|
|
425 |
different variables is their binding scope. FIXME}
|
18537
|
426 |
|
20502
|
427 |
A \emph{proposition} is a well-formed term of type \isa{prop}.
|
|
428 |
The connectives of minimal logic are declared as constants of the
|
|
429 |
basic theory:
|
18537
|
430 |
|
20502
|
431 |
\smallskip
|
|
432 |
\begin{tabular}{ll}
|
|
433 |
\isa{all\ {\isacharcolon}{\isacharcolon}\ {\isacharparenleft}{\isasymalpha}\ {\isasymRightarrow}\ prop{\isacharparenright}\ {\isasymRightarrow}\ prop} & universal quantification (binder \isa{{\isasymAnd}}) \\
|
|
434 |
\isa{{\isasymLongrightarrow}\ {\isacharcolon}{\isacharcolon}\ prop\ {\isasymRightarrow}\ prop\ {\isasymRightarrow}\ prop} & implication (right associative infix) \\
|
|
435 |
\end{tabular}
|
18537
|
436 |
|
20502
|
437 |
\medskip A \emph{theorem} is a proven proposition, depending on a
|
|
438 |
collection of assumptions, and axioms from the theory context. The
|
|
439 |
judgment \isa{A\isactrlisub {\isadigit{1}}{\isacharcomma}\ {\isasymdots}{\isacharcomma}\ A\isactrlisub n\ {\isasymturnstile}\ B} is defined
|
|
440 |
inductively by the primitive inferences given in
|
|
441 |
\figref{fig:prim-rules}; there is a global syntactic restriction
|
|
442 |
that the hypotheses may not contain schematic variables.
|
18537
|
443 |
|
20502
|
444 |
\begin{figure}[htb]
|
|
445 |
\begin{center}
|
20499
|
446 |
\[
|
|
447 |
\infer[\isa{{\isacharparenleft}axiom{\isacharparenright}}]{\isa{{\isasymturnstile}\ A}}{\isa{A\ {\isasymin}\ {\isasymTheta}}}
|
|
448 |
\qquad
|
|
449 |
\infer[\isa{{\isacharparenleft}assume{\isacharparenright}}]{\isa{A\ {\isasymturnstile}\ A}}{}
|
|
450 |
\]
|
|
451 |
\[
|
|
452 |
\infer[\isa{{\isacharparenleft}{\isasymAnd}{\isacharunderscore}intro{\isacharparenright}}]{\isa{{\isasymGamma}\ {\isasymturnstile}\ {\isasymAnd}x{\isachardot}\ b\ x}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ b\ x} & \isa{x\ {\isasymnotin}\ {\isasymGamma}}}
|
|
453 |
\qquad
|
|
454 |
\infer[\isa{{\isacharparenleft}{\isasymAnd}{\isacharunderscore}elim{\isacharparenright}}]{\isa{{\isasymGamma}\ {\isasymturnstile}\ b\ a}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ {\isasymAnd}x{\isachardot}\ b\ x}}
|
|
455 |
\]
|
|
456 |
\[
|
|
457 |
\infer[\isa{{\isacharparenleft}{\isasymLongrightarrow}{\isacharunderscore}intro{\isacharparenright}}]{\isa{{\isasymGamma}\ {\isacharminus}\ A\ {\isasymturnstile}\ A\ {\isasymLongrightarrow}\ B}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ B}}
|
|
458 |
\qquad
|
|
459 |
\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}}
|
|
460 |
\]
|
20502
|
461 |
\caption{Primitive inferences of the Pure logic}\label{fig:prim-rules}
|
|
462 |
\end{center}
|
|
463 |
\end{figure}
|
20499
|
464 |
|
20502
|
465 |
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
|
|
466 |
are \emph{irrelevant} in the Pure logic, they may never occur within
|
|
467 |
propositions, i.e.\ the \isa{{\isasymLongrightarrow}} arrow of the framework is a
|
|
468 |
non-dependent one.
|
20499
|
469 |
|
20502
|
470 |
Also note that fixed parameters as in \isa{{\isasymAnd}{\isacharunderscore}intro} need not be
|
|
471 |
recorded in the context \isa{{\isasymGamma}}, since syntactic types are
|
|
472 |
always inhabitable. An ``assumption'' \isa{x\ {\isacharcolon}{\isacharcolon}\ {\isasymtau}} is logically
|
|
473 |
vacuous, because \isa{{\isasymtau}} is always non-empty. This is the deeper
|
|
474 |
reason why \isa{{\isasymGamma}} only consists of hypothetical proofs, but no
|
|
475 |
hypothetical terms.
|
|
476 |
|
|
477 |
The corresponding proof terms are left implicit in the classic
|
|
478 |
``LCF-approach'', although they could be exploited separately
|
|
479 |
\cite{Berghofer-Nipkow:2000}. The implementation provides a runtime
|
|
480 |
option to control the generation of full proof terms.
|
|
481 |
|
|
482 |
\medskip The axiomatization of a theory is implicitly closed by
|
20520
|
483 |
forming all instances of type and term variables: \isa{{\isasymturnstile}\ A{\isasymvartheta}} for
|
20514
|
484 |
any substitution instance of axiom \isa{{\isasymturnstile}\ A}. By pushing
|
20502
|
485 |
substitution through derivations inductively, we get admissible
|
|
486 |
substitution rules for theorems shown in \figref{fig:subst-rules}.
|
|
487 |
|
|
488 |
\begin{figure}[htb]
|
|
489 |
\begin{center}
|
20499
|
490 |
\[
|
20502
|
491 |
\infer{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}{\isacharquery}{\isasymalpha}{\isacharbrackright}}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}{\isasymalpha}{\isacharbrackright}} & \isa{{\isasymalpha}\ {\isasymnotin}\ {\isasymGamma}}}
|
|
492 |
\quad
|
|
493 |
\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
|
494 |
\]
|
|
495 |
\[
|
20502
|
496 |
\infer{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}{\isasymtau}{\isacharbrackright}}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}{\isacharquery}{\isasymalpha}{\isacharbrackright}}}
|
|
497 |
\quad
|
|
498 |
\infer[\quad\isa{{\isacharparenleft}instantiate{\isacharparenright}}]{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}t{\isacharbrackright}}}{\isa{{\isasymGamma}\ {\isasymturnstile}\ B{\isacharbrackleft}{\isacharquery}x{\isacharbrackright}}}
|
20499
|
499 |
\]
|
20502
|
500 |
\caption{Admissible substitution rules}\label{fig:subst-rules}
|
|
501 |
\end{center}
|
|
502 |
\end{figure}
|
20499
|
503 |
|
|
504 |
Note that \isa{instantiate{\isacharunderscore}term} could be derived using \isa{{\isasymAnd}{\isacharunderscore}intro{\isacharslash}elim}, but this is not how it is implemented. The type
|
20502
|
505 |
instantiation rule is a genuine admissible one, due to the lack of
|
|
506 |
true polymorphism in the logic.
|
20499
|
507 |
|
20502
|
508 |
Since \isa{{\isasymGamma}} may never contain any schematic variables, the
|
|
509 |
\isa{instantiate} do not require an explicit side-condition. In
|
|
510 |
principle, variables could be substituted in hypotheses as well, but
|
|
511 |
this could disrupt monotonicity of the basic calculus: derivations
|
|
512 |
could leave the current proof context.
|
20499
|
513 |
|
20502
|
514 |
\medskip The framework also provides builtin equality \isa{{\isasymequiv}},
|
|
515 |
which is conceptually axiomatized shown in \figref{fig:equality},
|
|
516 |
although the implementation provides derived rules directly:
|
|
517 |
|
|
518 |
\begin{figure}[htb]
|
|
519 |
\begin{center}
|
20499
|
520 |
\begin{tabular}{ll}
|
|
521 |
\isa{{\isasymequiv}\ {\isacharcolon}{\isacharcolon}\ {\isasymalpha}\ {\isasymRightarrow}\ {\isasymalpha}\ {\isasymRightarrow}\ prop} & equality relation (infix) \\
|
20502
|
522 |
\isa{{\isasymturnstile}\ {\isacharparenleft}{\isasymlambda}x{\isachardot}\ b\ x{\isacharparenright}\ a\ {\isasymequiv}\ b\ a} & \isa{{\isasymbeta}}-conversion \\
|
20499
|
523 |
\isa{{\isasymturnstile}\ x\ {\isasymequiv}\ x} & reflexivity law \\
|
|
524 |
\isa{{\isasymturnstile}\ x\ {\isasymequiv}\ y\ {\isasymLongrightarrow}\ P\ x\ {\isasymLongrightarrow}\ P\ y} & substitution law \\
|
|
525 |
\isa{{\isasymturnstile}\ {\isacharparenleft}{\isasymAnd}x{\isachardot}\ f\ x\ {\isasymequiv}\ g\ x{\isacharparenright}\ {\isasymLongrightarrow}\ f\ {\isasymequiv}\ g} & extensionality \\
|
|
526 |
\isa{{\isasymturnstile}\ {\isacharparenleft}A\ {\isasymLongrightarrow}\ B{\isacharparenright}\ {\isasymLongrightarrow}\ {\isacharparenleft}B\ {\isasymLongrightarrow}\ A{\isacharparenright}\ {\isasymLongrightarrow}\ A\ {\isasymequiv}\ B} & coincidence with equivalence \\
|
|
527 |
\end{tabular}
|
20502
|
528 |
\caption{Conceptual axiomatization of equality.}\label{fig:equality}
|
|
529 |
\end{center}
|
|
530 |
\end{figure}
|
|
531 |
|
|
532 |
Since the basic representation of terms already accounts for \isa{{\isasymalpha}}-conversion, Pure equality essentially acts like \isa{{\isasymalpha}{\isasymbeta}{\isasymeta}}-equivalence on terms, while coinciding with bi-implication.
|
|
533 |
|
|
534 |
|
|
535 |
\medskip Conjunction is defined in Pure as a derived connective, see
|
|
536 |
\figref{fig:conjunction}. This is occasionally useful to represent
|
|
537 |
simultaneous statements behind the scenes --- framework conjunction
|
|
538 |
is usually not exposed to the user.
|
|
539 |
|
|
540 |
\begin{figure}[htb]
|
|
541 |
\begin{center}
|
|
542 |
\begin{tabular}{ll}
|
|
543 |
\isa{{\isacharampersand}\ {\isacharcolon}{\isacharcolon}\ prop\ {\isasymRightarrow}\ prop\ {\isasymRightarrow}\ prop} & conjunction (hidden) \\
|
|
544 |
\isa{{\isasymturnstile}\ A\ {\isacharampersand}\ B\ {\isasymequiv}\ {\isacharparenleft}{\isasymAnd}C{\isachardot}\ {\isacharparenleft}A\ {\isasymLongrightarrow}\ B\ {\isasymLongrightarrow}\ C{\isacharparenright}\ {\isasymLongrightarrow}\ C{\isacharparenright}} \\
|
|
545 |
\end{tabular}
|
|
546 |
\caption{Definition of conjunction.}\label{fig:equality}
|
|
547 |
\end{center}
|
|
548 |
\end{figure}
|
|
549 |
|
|
550 |
The definition allows to derive the usual introduction \isa{{\isasymturnstile}\ A\ {\isasymLongrightarrow}\ B\ {\isasymLongrightarrow}\ A\ {\isacharampersand}\ B}, and destructions \isa{A\ {\isacharampersand}\ B\ {\isasymLongrightarrow}\ A} and \isa{A\ {\isacharampersand}\ B\ {\isasymLongrightarrow}\ B}.%
|
18537
|
551 |
\end{isamarkuptext}%
|
|
552 |
\isamarkuptrue%
|
|
553 |
%
|
20491
|
554 |
\isamarkupsection{Rules \label{sec:rules}%
|
18537
|
555 |
}
|
|
556 |
\isamarkuptrue%
|
|
557 |
%
|
|
558 |
\begin{isamarkuptext}%
|
|
559 |
FIXME
|
|
560 |
|
20491
|
561 |
A \emph{rule} is any Pure theorem in HHF normal form; there is a
|
|
562 |
separate calculus for rule composition, which is modeled after
|
|
563 |
Gentzen's Natural Deduction \cite{Gentzen:1935}, but allows
|
|
564 |
rules to be nested arbitrarily, similar to \cite{extensions91}.
|
|
565 |
|
|
566 |
Normally, all theorems accessible to the user are proper rules.
|
|
567 |
Low-level inferences are occasional required internally, but the
|
|
568 |
result should be always presented in canonical form. The higher
|
|
569 |
interfaces of Isabelle/Isar will always produce proper rules. It is
|
|
570 |
important to maintain this invariant in add-on applications!
|
|
571 |
|
|
572 |
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
|
573 |
combined in the variants of \isa{elim{\isacharminus}resolution} and \isa{dest{\isacharminus}resolution}. Raw \isa{composition} is occasionally
|
20491
|
574 |
useful as well, also it is strictly speaking outside of the proper
|
|
575 |
rule calculus.
|
|
576 |
|
|
577 |
Rules are treated modulo general higher-order unification, which is
|
|
578 |
unification modulo the equational theory of \isa{{\isasymalpha}{\isasymbeta}{\isasymeta}}-conversion
|
|
579 |
on \isa{{\isasymlambda}}-terms. Moreover, propositions are understood modulo
|
|
580 |
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}}.
|
|
581 |
|
|
582 |
This means that any operations within the rule calculus may be
|
|
583 |
subject to spontaneous \isa{{\isasymalpha}{\isasymbeta}{\isasymeta}}-HHF conversions. It is common
|
|
584 |
practice not to contract or expand unnecessarily. Some mechanisms
|
|
585 |
prefer an one form, others the opposite, so there is a potential
|
|
586 |
danger to produce some oscillation!
|
|
587 |
|
|
588 |
Only few operations really work \emph{modulo} HHF conversion, but
|
|
589 |
expect a normal form: quantifiers \isa{{\isasymAnd}} before implications
|
|
590 |
\isa{{\isasymLongrightarrow}} at each level of nesting.
|
|
591 |
|
18537
|
592 |
\glossary{Hereditary Harrop Formula}{The set of propositions in HHF
|
|
593 |
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}.
|
|
594 |
Any proposition may be put into HHF form by normalizing with the rule
|
|
595 |
\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
|
|
596 |
quantifier prefix is represented via \seeglossary{schematic
|
|
597 |
variables}, such that the top-level structure is merely that of a
|
|
598 |
\seeglossary{Horn Clause}}.
|
|
599 |
|
20499
|
600 |
\glossary{HHF}{See \seeglossary{Hereditary Harrop Formula}.}
|
|
601 |
|
|
602 |
|
|
603 |
\[
|
|
604 |
\infer[\isa{{\isacharparenleft}assumption{\isacharparenright}}]{\isa{C{\isasymvartheta}}}
|
|
605 |
{\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})}}
|
|
606 |
\]
|
|
607 |
|
|
608 |
|
|
609 |
\[
|
|
610 |
\infer[\isa{{\isacharparenleft}compose{\isacharparenright}}]{\isa{\isactrlvec A{\isasymvartheta}\ {\isasymLongrightarrow}\ C{\isasymvartheta}}}
|
|
611 |
{\isa{\isactrlvec A\ {\isasymLongrightarrow}\ B} & \isa{B{\isacharprime}\ {\isasymLongrightarrow}\ C} & \isa{B{\isasymvartheta}\ {\isacharequal}\ B{\isacharprime}{\isasymvartheta}}}
|
|
612 |
\]
|
|
613 |
|
|
614 |
|
|
615 |
\[
|
|
616 |
\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}}
|
|
617 |
\]
|
|
618 |
\[
|
|
619 |
\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}}
|
|
620 |
\]
|
|
621 |
|
|
622 |
The \isa{resolve} scheme is now acquired from \isa{{\isasymAnd}{\isacharunderscore}lift},
|
|
623 |
\isa{{\isasymLongrightarrow}{\isacharunderscore}lift}, and \isa{compose}.
|
|
624 |
|
|
625 |
\[
|
|
626 |
\infer[\isa{{\isacharparenleft}resolution{\isacharparenright}}]
|
|
627 |
{\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}}}
|
|
628 |
{\begin{tabular}{l}
|
|
629 |
\isa{\isactrlvec A\ {\isacharquery}\isactrlvec a\ {\isasymLongrightarrow}\ B\ {\isacharquery}\isactrlvec a} \\
|
|
630 |
\isa{{\isacharparenleft}{\isasymAnd}\isactrlvec x{\isachardot}\ \isactrlvec H\ \isactrlvec x\ {\isasymLongrightarrow}\ B{\isacharprime}\ \isactrlvec x{\isacharparenright}\ {\isasymLongrightarrow}\ C} \\
|
|
631 |
\isa{{\isacharparenleft}{\isasymlambda}\isactrlvec x{\isachardot}\ B\ {\isacharparenleft}{\isacharquery}\isactrlvec a\ \isactrlvec x{\isacharparenright}{\isacharparenright}{\isasymvartheta}\ {\isacharequal}\ B{\isacharprime}{\isasymvartheta}} \\
|
|
632 |
\end{tabular}}
|
|
633 |
\]
|
|
634 |
|
|
635 |
|
|
636 |
FIXME \isa{elim{\isacharunderscore}resolution}, \isa{dest{\isacharunderscore}resolution}%
|
18537
|
637 |
\end{isamarkuptext}%
|
|
638 |
\isamarkuptrue%
|
|
639 |
%
|
|
640 |
\isadelimtheory
|
|
641 |
%
|
|
642 |
\endisadelimtheory
|
|
643 |
%
|
|
644 |
\isatagtheory
|
|
645 |
\isacommand{end}\isamarkupfalse%
|
|
646 |
%
|
|
647 |
\endisatagtheory
|
|
648 |
{\isafoldtheory}%
|
|
649 |
%
|
|
650 |
\isadelimtheory
|
|
651 |
%
|
|
652 |
\endisadelimtheory
|
|
653 |
\isanewline
|
|
654 |
\end{isabellebody}%
|
|
655 |
%%% Local Variables:
|
|
656 |
%%% mode: latex
|
|
657 |
%%% TeX-master: "root"
|
|
658 |
%%% End:
|