754
+ − 1
(*<*)
+ − 2
theory Paper
2330
+ − 3
imports "../Nominal/NewParser" "LaTeXsugar"
754
+ − 4
begin
1493
+ − 5
1657
+ − 6
consts
+ − 7
fv :: "'a \<Rightarrow> 'b"
1728
+ − 8
abs_set :: "'a \<Rightarrow> 'b \<Rightarrow> 'c"
+ − 9
alpha_bn :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
1763
+ − 10
abs_set2 :: "'a \<Rightarrow> perm \<Rightarrow> 'b \<Rightarrow> 'c"
1796
5165c350ee1a
clarified comment about distinct lists in th efuture work section
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 11
Abs_dist :: "'a \<Rightarrow> 'b \<Rightarrow> 'c"
2163
+ − 12
Abs_print :: "'a \<Rightarrow> 'b \<Rightarrow> 'c"
1657
+ − 13
+ − 14
definition
+ − 15
"equal \<equiv> (op =)"
+ − 16
1493
+ − 17
notation (latex output)
+ − 18
swap ("'(_ _')" [1000, 1000] 1000) and
+ − 19
fresh ("_ # _" [51, 51] 50) and
1694
+ − 20
fresh_star ("_ #\<^sup>* _" [51, 51] 50) and
1493
+ − 21
supp ("supp _" [78] 73) and
+ − 22
uminus ("-_" [78] 73) and
1657
+ − 23
If ("if _ then _ else _" 10) and
2341
+ − 24
alpha_gen ("_ \<approx>\<^raw:\,\raisebox{-1pt}{\makebox[0mm][l]{$_{\textit{set}}$}}>\<^bsup>_, _, _\<^esup> _") and
+ − 25
alpha_lst ("_ \<approx>\<^raw:\,\raisebox{-1pt}{\makebox[0mm][l]{$_{\textit{list}}$}}>\<^bsup>_, _, _\<^esup> _") and
+ − 26
alpha_res ("_ \<approx>\<^raw:\,\raisebox{-1pt}{\makebox[0mm][l]{$_{\textit{res}}$}}>\<^bsup>_, _, _\<^esup> _") and
1657
+ − 27
abs_set ("_ \<approx>\<^raw:{$\,_{\textit{abs\_set}}$}> _") and
1763
+ − 28
abs_set2 ("_ \<approx>\<^raw:\raisebox{-1pt}{\makebox[0mm][l]{$\,_{\textit{list}}$}}>\<^bsup>_\<^esup> _") and
2347
+ − 29
fv ("fa'(_')" [100] 100) and
1657
+ − 30
equal ("=") and
+ − 31
alpha_abs ("_ \<approx>\<^raw:{$\,_{\textit{abs\_set}}$}> _") and
2331
+ − 32
Abs ("[_]\<^bsub>set\<^esub>._" [20, 101] 999) and
+ − 33
Abs_lst ("[_]\<^bsub>list\<^esub>._") and
+ − 34
Abs_dist ("[_]\<^bsub>#list\<^esub>._") and
+ − 35
Abs_res ("[_]\<^bsub>res\<^esub>._") and
+ − 36
Abs_print ("_\<^bsub>set\<^esub>._") and
1703
+ − 37
Cons ("_::_" [78,77] 73) and
1728
+ − 38
supp_gen ("aux _" [1000] 10) and
+ − 39
alpha_bn ("_ \<approx>bn _")
2359
+ − 40
+ − 41
consts alpha_trm ::'a
+ − 42
consts fa_trm :: 'a
+ − 43
consts alpha_trm2 ::'a
+ − 44
consts fa_trm2 :: 'a
+ − 45
consts ast :: 'a
+ − 46
consts ast' :: 'a
+ − 47
notation (latex output)
+ − 48
alpha_trm ("\<approx>\<^bsub>trm\<^esub>") and
+ − 49
fa_trm ("fa\<^bsub>trm\<^esub>") and
+ − 50
alpha_trm2 ("'(\<approx>\<^bsub>assn\<^esub>, \<approx>\<^bsub>trm\<^esub>')") and
+ − 51
fa_trm2 ("'(fa\<^bsub>assn\<^esub>, fa\<^bsub>trm\<^esub>')") and
+ − 52
ast ("'(as, t')") and
+ − 53
ast' ("'(as', t\<PRIME> ')")
+ − 54
754
+ − 55
(*>*)
+ − 56
1657
+ − 57
754
+ − 58
section {* Introduction *}
+ − 59
+ − 60
text {*
1739
+ − 61
2345
+ − 62
So far, Nominal Isabelle provided a mechanism for constructing
2343
+ − 63
$\alpha$-equated terms, for example lambda-terms
1485
+ − 64
1520
+ − 65
\begin{center}
1657
+ − 66
@{text "t ::= x | t t | \<lambda>x. t"}
1520
+ − 67
\end{center}
+ − 68
+ − 69
\noindent
2341
+ − 70
where free and bound variables have names. For such $\alpha$-equated terms,
2163
+ − 71
Nominal Isabelle derives automatically a reasoning infrastructure that has
+ − 72
been used successfully in formalisations of an equivalence checking
+ − 73
algorithm for LF \cite{UrbanCheneyBerghofer08}, Typed
1520
+ − 74
Scheme~\cite{TobinHochstadtFelleisen08}, several calculi for concurrency
2163
+ − 75
\cite{BengtsonParow09} and a strong normalisation result for cut-elimination
+ − 76
in classical logic \cite{UrbanZhu08}. It has also been used by Pollack for
+ − 77
formalisations in the locally-nameless approach to binding
+ − 78
\cite{SatoPollack10}.
1520
+ − 79
1535
+ − 80
However, Nominal Isabelle has fared less well in a formalisation of
1690
+ − 81
the algorithm W \cite{UrbanNipkow09}, where types and type-schemes are,
+ − 82
respectively, of the form
1570
+ − 83
%
+ − 84
\begin{equation}\label{tysch}
+ − 85
\begin{array}{l}
1657
+ − 86
@{text "T ::= x | T \<rightarrow> T"}\hspace{5mm}
+ − 87
@{text "S ::= \<forall>{x\<^isub>1,\<dots>, x\<^isub>n}. T"}
1570
+ − 88
\end{array}
+ − 89
\end{equation}
1520
+ − 90
+ − 91
\noindent
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 92
and the @{text "\<forall>"}-quantification binds a finite (possibly empty) set of
1550
+ − 93
type-variables. While it is possible to implement this kind of more general
+ − 94
binders by iterating single binders, this leads to a rather clumsy
+ − 95
formalisation of W. The need of iterating single binders is also one reason
+ − 96
why Nominal Isabelle and similar theorem provers that only provide
+ − 97
mechanisms for binding single variables have not fared extremely well with the
+ − 98
more advanced tasks in the POPLmark challenge \cite{challenge05}, because
+ − 99
also there one would like to bind multiple variables at once.
1520
+ − 100
1577
+ − 101
Binding multiple variables has interesting properties that cannot be captured
2176
+ − 102
easily by iterating single binders. For example in the case of type-schemes we do not
1587
+ − 103
want to make a distinction about the order of the bound variables. Therefore
2341
+ − 104
we would like to regard the following two type-schemes as $\alpha$-equivalent
1572
+ − 105
%
+ − 106
\begin{equation}\label{ex1}
2346
+ − 107
@{text "\<forall>{x, y}. x \<rightarrow> y \<approx>\<^isub>\<alpha> \<forall>{y, x}. x \<rightarrow> y"}
1572
+ − 108
\end{equation}
1520
+ − 109
+ − 110
\noindent
1657
+ − 111
but assuming that @{text x}, @{text y} and @{text z} are distinct variables,
2341
+ − 112
the following two should \emph{not} be $\alpha$-equivalent
1572
+ − 113
%
+ − 114
\begin{equation}\label{ex2}
1667
+ − 115
@{text "\<forall>{x, y}. x \<rightarrow> y \<notapprox>\<^isub>\<alpha> \<forall>{z}. z \<rightarrow> z"}
1572
+ − 116
\end{equation}
1520
+ − 117
+ − 118
\noindent
2341
+ − 119
Moreover, we like to regard type-schemes as $\alpha$-equivalent, if they differ
1657
+ − 120
only on \emph{vacuous} binders, such as
1572
+ − 121
%
+ − 122
\begin{equation}\label{ex3}
1667
+ − 123
@{text "\<forall>{x}. x \<rightarrow> y \<approx>\<^isub>\<alpha> \<forall>{x, z}. x \<rightarrow> y"}
1572
+ − 124
\end{equation}
1485
+ − 125
1520
+ − 126
\noindent
1657
+ − 127
where @{text z} does not occur freely in the type. In this paper we will
2341
+ − 128
give a general binding mechanism and associated notion of $\alpha$-equivalence
1657
+ − 129
that can be used to faithfully represent this kind of binding in Nominal
2341
+ − 130
Isabelle. The difficulty of finding the right notion for $\alpha$-equivalence
1657
+ − 131
can be appreciated in this case by considering that the definition given by
2331
+ − 132
Leroy in \cite{Leroy92} is incorrect (it omits a side-condition).
1524
+ − 133
2341
+ − 134
However, the notion of $\alpha$-equivalence that is preserved by vacuous
1657
+ − 135
binders is not always wanted. For example in terms like
1587
+ − 136
%
1535
+ − 137
\begin{equation}\label{one}
1657
+ − 138
@{text "\<LET> x = 3 \<AND> y = 2 \<IN> x - y \<END>"}
1535
+ − 139
\end{equation}
1520
+ − 140
+ − 141
\noindent
2341
+ − 142
we might not care in which order the assignments @{text "x = 3"} and
+ − 143
\mbox{@{text "y = 2"}} are given, but it would be unusual to regard
+ − 144
\eqref{one} as $\alpha$-equivalent with
1587
+ − 145
%
1520
+ − 146
\begin{center}
1657
+ − 147
@{text "\<LET> x = 3 \<AND> y = 2 \<AND> z = loop \<IN> x - y \<END>"}
1520
+ − 148
\end{center}
+ − 149
+ − 150
\noindent
1550
+ − 151
Therefore we will also provide a separate binding mechanism for cases in
+ − 152
which the order of binders does not matter, but the ``cardinality'' of the
1535
+ − 153
binders has to agree.
1520
+ − 154
1550
+ − 155
However, we found that this is still not sufficient for dealing with
+ − 156
language constructs frequently occurring in programming language
1690
+ − 157
research. For example in @{text "\<LET>"}s containing patterns like
1587
+ − 158
%
1535
+ − 159
\begin{equation}\label{two}
1657
+ − 160
@{text "\<LET> (x, y) = (3, 2) \<IN> x - y \<END>"}
1535
+ − 161
\end{equation}
1520
+ − 162
+ − 163
\noindent
1535
+ − 164
we want to bind all variables from the pattern inside the body of the
+ − 165
$\mathtt{let}$, but we also care about the order of these variables, since
2341
+ − 166
we do not want to regard \eqref{two} as $\alpha$-equivalent with
1587
+ − 167
%
1520
+ − 168
\begin{center}
1657
+ − 169
@{text "\<LET> (y, x) = (3, 2) \<IN> x - y \<END>"}
1520
+ − 170
\end{center}
2218
+ − 171
%
1520
+ − 172
\noindent
1657
+ − 173
As a result, we provide three general binding mechanisms each of which binds
+ − 174
multiple variables at once, and let the user chose which one is intended
1711
+ − 175
when formalising a term-calculus.
1485
+ − 176
1657
+ − 177
By providing these general binding mechanisms, however, we have to work
+ − 178
around a problem that has been pointed out by Pottier \cite{Pottier06} and
+ − 179
Cheney \cite{Cheney05}: in @{text "\<LET>"}-constructs of the form
1587
+ − 180
%
1520
+ − 181
\begin{center}
1657
+ − 182
@{text "\<LET> x\<^isub>1 = t\<^isub>1 \<AND> \<dots> \<AND> x\<^isub>n = t\<^isub>n \<IN> s \<END>"}
1520
+ − 183
\end{center}
+ − 184
+ − 185
\noindent
1657
+ − 186
which bind all the @{text "x\<^isub>i"} in @{text s}, we might not care
+ − 187
about the order in which the @{text "x\<^isub>i = t\<^isub>i"} are given,
+ − 188
but we do care about the information that there are as many @{text
+ − 189
"x\<^isub>i"} as there are @{text "t\<^isub>i"}. We lose this information if
+ − 190
we represent the @{text "\<LET>"}-constructor by something like
1587
+ − 191
%
1523
+ − 192
\begin{center}
2341
+ − 193
@{text "\<LET> (\<lambda>x\<^isub>1\<dots>x\<^isub>n . s) [t\<^isub>1,\<dots>,t\<^isub>n]"}
1523
+ − 194
\end{center}
1520
+ − 195
1523
+ − 196
\noindent
2341
+ − 197
where the notation @{text "\<lambda>_ . _"} indicates that the list of @{text
+ − 198
"x\<^isub>i"} becomes bound in @{text s}. In this representation the term
+ − 199
\mbox{@{text "\<LET> (\<lambda>x . s) [t\<^isub>1, t\<^isub>2]"}} is a perfectly legal
+ − 200
instance, but the lengths of the two lists do not agree. To exclude such
+ − 201
terms, additional predicates about well-formed terms are needed in order to
+ − 202
ensure that the two lists are of equal length. This can result in very messy
+ − 203
reasoning (see for example~\cite{BengtsonParow09}). To avoid this, we will
+ − 204
allow type specifications for @{text "\<LET>"}s as follows
1587
+ − 205
%
1528
+ − 206
\begin{center}
+ − 207
\begin{tabular}{r@ {\hspace{2mm}}r@ {\hspace{2mm}}l}
1657
+ − 208
@{text trm} & @{text "::="} & @{text "\<dots>"}\\
2341
+ − 209
& @{text "|"} & @{text "\<LET> as::assn s::trm"}\hspace{4mm}
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 210
\isacommand{bind} @{text "bn(as)"} \isacommand{in} @{text "s"}\\[1mm]
1657
+ − 211
@{text assn} & @{text "::="} & @{text "\<ANIL>"}\\
2341
+ − 212
& @{text "|"} & @{text "\<ACONS> name trm assn"}
1528
+ − 213
\end{tabular}
+ − 214
\end{center}
+ − 215
+ − 216
\noindent
1657
+ − 217
where @{text assn} is an auxiliary type representing a list of assignments
+ − 218
and @{text bn} an auxiliary function identifying the variables to be bound
1687
+ − 219
by the @{text "\<LET>"}. This function can be defined by recursion over @{text
1657
+ − 220
assn} as follows
1528
+ − 221
+ − 222
\begin{center}
1657
+ − 223
@{text "bn(\<ANIL>) ="} @{term "{}"} \hspace{5mm}
+ − 224
@{text "bn(\<ACONS> x t as) = {x} \<union> bn(as)"}
1528
+ − 225
\end{center}
1523
+ − 226
1528
+ − 227
\noindent
1550
+ − 228
The scope of the binding is indicated by labels given to the types, for
1657
+ − 229
example @{text "s::trm"}, and a binding clause, in this case
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 230
\isacommand{bind} @{text "bn(as)"} \isacommand{in} @{text "s"}. This binding
2346
+ − 231
clause states that all the names the function @{text
+ − 232
"bn(as)"} returns should be bound in @{text s}. This style of specifying terms and bindings is heavily
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 233
inspired by the syntax of the Ott-tool \cite{ott-jfp}.
1657
+ − 234
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 235
However, we will not be able to cope with all specifications that are
2176
+ − 236
allowed by Ott. One reason is that Ott lets the user specify ``empty''
1617
+ − 237
types like
1570
+ − 238
+ − 239
\begin{center}
1657
+ − 240
@{text "t ::= t t | \<lambda>x. t"}
1570
+ − 241
\end{center}
+ − 242
+ − 243
\noindent
1617
+ − 244
where no clause for variables is given. Arguably, such specifications make
+ − 245
some sense in the context of Coq's type theory (which Ott supports), but not
+ − 246
at all in a HOL-based environment where every datatype must have a non-empty
1719
+ − 247
set-theoretic model \cite{Berghofer99}.
1570
+ − 248
+ − 249
Another reason is that we establish the reasoning infrastructure
2341
+ − 250
for $\alpha$-\emph{equated} terms. In contrast, Ott produces a reasoning
1570
+ − 251
infrastructure in Isabelle/HOL for
2341
+ − 252
\emph{non}-$\alpha$-equated, or ``raw'', terms. While our $\alpha$-equated terms
1556
+ − 253
and the raw terms produced by Ott use names for bound variables,
2341
+ − 254
there is a key difference: working with $\alpha$-equated terms means, for example,
1693
+ − 255
that the two type-schemes
1528
+ − 256
+ − 257
\begin{center}
1667
+ − 258
@{text "\<forall>{x}. x \<rightarrow> y = \<forall>{x, z}. x \<rightarrow> y"}
1528
+ − 259
\end{center}
+ − 260
+ − 261
\noindent
2341
+ − 262
are not just $\alpha$-equal, but actually \emph{equal}! As a result, we can
+ − 263
only support specifications that make sense on the level of $\alpha$-equated
1657
+ − 264
terms (offending specifications, which for example bind a variable according
+ − 265
to a variable bound somewhere else, are not excluded by Ott, but we have
1687
+ − 266
to).
+ − 267
2341
+ − 268
Our insistence on reasoning with $\alpha$-equated terms comes from the
1657
+ − 269
wealth of experience we gained with the older version of Nominal Isabelle:
2341
+ − 270
for non-trivial properties, reasoning with $\alpha$-equated terms is much
1657
+ − 271
easier than reasoning with raw terms. The fundamental reason for this is
+ − 272
that the HOL-logic underlying Nominal Isabelle allows us to replace
+ − 273
``equals-by-equals''. In contrast, replacing
2341
+ − 274
``$\alpha$-equals-by-$\alpha$-equals'' in a representation based on raw terms
1657
+ − 275
requires a lot of extra reasoning work.
1535
+ − 276
2341
+ − 277
Although in informal settings a reasoning infrastructure for $\alpha$-equated
1657
+ − 278
terms is nearly always taken for granted, establishing it automatically in
+ − 279
the Isabelle/HOL theorem prover is a rather non-trivial task. For every
+ − 280
specification we will need to construct a type containing as elements the
2341
+ − 281
$\alpha$-equated terms. To do so, we use the standard HOL-technique of defining
1657
+ − 282
a new type by identifying a non-empty subset of an existing type. The
1667
+ − 283
construction we perform in Isabelle/HOL can be illustrated by the following picture:
1657
+ − 284
1528
+ − 285
\begin{center}
1552
+ − 286
\begin{tikzpicture}
+ − 287
%\draw[step=2mm] (-4,-1) grid (4,1);
+ − 288
+ − 289
\draw[very thick] (0.7,0.4) circle (4.25mm);
+ − 290
\draw[rounded corners=1mm, very thick] ( 0.0,-0.8) rectangle ( 1.8, 0.9);
+ − 291
\draw[rounded corners=1mm, very thick] (-1.95,0.85) rectangle (-2.85,-0.05);
+ − 292
+ − 293
\draw (-2.0, 0.845) -- (0.7,0.845);
+ − 294
\draw (-2.0,-0.045) -- (0.7,-0.045);
+ − 295
+ − 296
\draw ( 0.7, 0.4) node {\begin{tabular}{@ {}c@ {}}$\alpha$-\\[-1mm]clas.\end{tabular}};
+ − 297
\draw (-2.4, 0.4) node {\begin{tabular}{@ {}c@ {}}$\alpha$-eq.\\[-1mm]terms\end{tabular}};
+ − 298
\draw (1.8, 0.48) node[right=-0.1mm]
+ − 299
{\begin{tabular}{@ {}l@ {}}existing\\[-1mm] type\\ (sets of raw terms)\end{tabular}};
+ − 300
\draw (0.9, -0.35) node {\begin{tabular}{@ {}l@ {}}non-empty\\[-1mm]subset\end{tabular}};
+ − 301
\draw (-3.25, 0.55) node {\begin{tabular}{@ {}l@ {}}new\\[-1mm]type\end{tabular}};
+ − 302
+ − 303
\draw[<->, very thick] (-1.8, 0.3) -- (-0.1,0.3);
+ − 304
\draw (-0.95, 0.3) node[above=0mm] {isomorphism};
+ − 305
+ − 306
\end{tikzpicture}
1528
+ − 307
\end{center}
+ − 308
+ − 309
\noindent
1657
+ − 310
We take as the starting point a definition of raw terms (defined as a
2361
+ − 311
datatype in Isabelle/HOL); then identify the $\alpha$-equivalence classes in
2341
+ − 312
the type of sets of raw terms according to our $\alpha$-equivalence relation,
+ − 313
and finally define the new type as these $\alpha$-equivalence classes
1657
+ − 314
(non-emptiness is satisfied whenever the raw terms are definable as datatype
2341
+ − 315
in Isabelle/HOL and the property that our relation for $\alpha$-equivalence is
1657
+ − 316
indeed an equivalence relation).
1556
+ − 317
1657
+ − 318
The fact that we obtain an isomorphism between the new type and the
+ − 319
non-empty subset shows that the new type is a faithful representation of
2341
+ − 320
$\alpha$-equated terms. That is not the case for example for terms using the
1657
+ − 321
locally nameless representation of binders \cite{McKinnaPollack99}: in this
+ − 322
representation there are ``junk'' terms that need to be excluded by
+ − 323
reasoning about a well-formedness predicate.
1556
+ − 324
1657
+ − 325
The problem with introducing a new type in Isabelle/HOL is that in order to
+ − 326
be useful, a reasoning infrastructure needs to be ``lifted'' from the
+ − 327
underlying subset to the new type. This is usually a tricky and arduous
+ − 328
task. To ease it, we re-implemented in Isabelle/HOL the quotient package
+ − 329
described by Homeier \cite{Homeier05} for the HOL4 system. This package
+ − 330
allows us to lift definitions and theorems involving raw terms to
2341
+ − 331
definitions and theorems involving $\alpha$-equated terms. For example if we
1657
+ − 332
define the free-variable function over raw lambda-terms
1577
+ − 333
+ − 334
\begin{center}
1657
+ − 335
@{text "fv(x) = {x}"}\hspace{10mm}
+ − 336
@{text "fv(t\<^isub>1 t\<^isub>2) = fv(t\<^isub>1) \<union> fv(t\<^isub>2)"}\\[1mm]
+ − 337
@{text "fv(\<lambda>x.t) = fv(t) - {x}"}
1577
+ − 338
\end{center}
+ − 339
+ − 340
\noindent
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 341
then with the help of the quotient package we can obtain a function @{text "fv\<^sup>\<alpha>"}
2341
+ − 342
operating on quotients, or $\alpha$-equivalence classes of lambda-terms. This
1628
+ − 343
lifted function is characterised by the equations
1577
+ − 344
+ − 345
\begin{center}
1657
+ − 346
@{text "fv\<^sup>\<alpha>(x) = {x}"}\hspace{10mm}
+ − 347
@{text "fv\<^sup>\<alpha>(t\<^isub>1 t\<^isub>2) = fv\<^sup>\<alpha>(t\<^isub>1) \<union> fv\<^sup>\<alpha>(t\<^isub>2)"}\\[1mm]
+ − 348
@{text "fv\<^sup>\<alpha>(\<lambda>x.t) = fv\<^sup>\<alpha>(t) - {x}"}
1577
+ − 349
\end{center}
+ − 350
+ − 351
\noindent
+ − 352
(Note that this means also the term-constructors for variables, applications
+ − 353
and lambda are lifted to the quotient level.) This construction, of course,
2341
+ − 354
only works if $\alpha$-equivalence is indeed an equivalence relation, and the
+ − 355
``raw'' definitions and theorems are respectful w.r.t.~$\alpha$-equivalence.
1694
+ − 356
For example, we will not be able to lift a bound-variable function. Although
+ − 357
this function can be defined for raw terms, it does not respect
2341
+ − 358
$\alpha$-equivalence and therefore cannot be lifted. To sum up, every lifting
1694
+ − 359
of theorems to the quotient level needs proofs of some respectfulness
+ − 360
properties (see \cite{Homeier05}). In the paper we show that we are able to
2128
+ − 361
automate these proofs and as a result can automatically establish a reasoning
2341
+ − 362
infrastructure for $\alpha$-equated terms.
1667
+ − 363
+ − 364
The examples we have in mind where our reasoning infrastructure will be
1694
+ − 365
helpful includes the term language of System @{text "F\<^isub>C"}, also
+ − 366
known as Core-Haskell (see Figure~\ref{corehas}). This term language
1711
+ − 367
involves patterns that have lists of type-, coercion- and term-variables,
1703
+ − 368
all of which are bound in @{text "\<CASE>"}-expressions. One
1926
+ − 369
feature is that we do not know in advance how many variables need to
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 370
be bound. Another is that each bound variable comes with a kind or type
1694
+ − 371
annotation. Representing such binders with single binders and reasoning
+ − 372
about them in a theorem prover would be a major pain. \medskip
1506
+ − 373
1528
+ − 374
\noindent
2347
+ − 375
{\bf Contributions:} We provide three novel definitions for when terms
2341
+ − 376
involving general binders are $\alpha$-equivalent. These definitions are
1607
+ − 377
inspired by earlier work of Pitts \cite{Pitts04}. By means of automatic
2341
+ − 378
proofs, we establish a reasoning infrastructure for $\alpha$-equated
1528
+ − 379
terms, including properties about support, freshness and equality
2341
+ − 380
conditions for $\alpha$-equated terms. We are also able to derive strong
2218
+ − 381
induction principles that have the variable convention already built in.
2343
+ − 382
The method behind our specification of general binders is taken
2346
+ − 383
from the Ott-tool, but we introduce crucial restrictions, and also extensions, so
2343
+ − 384
that our specifications make sense for reasoning about $\alpha$-equated terms.
2341
+ − 385
1667
+ − 386
+ − 387
\begin{figure}
1687
+ − 388
\begin{boxedminipage}{\linewidth}
+ − 389
\begin{center}
1699
+ − 390
\begin{tabular}{r@ {\hspace{1mm}}r@ {\hspace{2mm}}l}
1690
+ − 391
\multicolumn{3}{@ {}l}{Type Kinds}\\
1699
+ − 392
@{text "\<kappa>"} & @{text "::="} & @{text "\<star> | \<kappa>\<^isub>1 \<rightarrow> \<kappa>\<^isub>2"}\smallskip\\
1690
+ − 393
\multicolumn{3}{@ {}l}{Coercion Kinds}\\
1699
+ − 394
@{text "\<iota>"} & @{text "::="} & @{text "\<sigma>\<^isub>1 \<sim> \<sigma>\<^isub>2"}\smallskip\\
1690
+ − 395
\multicolumn{3}{@ {}l}{Types}\\
1694
+ − 396
@{text "\<sigma>"} & @{text "::="} & @{text "a | T | \<sigma>\<^isub>1 \<sigma>\<^isub>2 | S\<^isub>n"}$\;\overline{@{text "\<sigma>"}}$@{text "\<^sup>n"}
1699
+ − 397
@{text "| \<forall>a:\<kappa>. \<sigma> | \<iota> \<Rightarrow> \<sigma>"}\smallskip\\
1690
+ − 398
\multicolumn{3}{@ {}l}{Coercion Types}\\
1694
+ − 399
@{text "\<gamma>"} & @{text "::="} & @{text "c | C | \<gamma>\<^isub>1 \<gamma>\<^isub>2 | S\<^isub>n"}$\;\overline{@{text "\<gamma>"}}$@{text "\<^sup>n"}
1699
+ − 400
@{text "| \<forall>c:\<iota>. \<gamma> | \<iota> \<Rightarrow> \<gamma> "}\\
+ − 401
& @{text "|"} & @{text "refl \<sigma> | sym \<gamma> | \<gamma>\<^isub>1 \<circ> \<gamma>\<^isub>2 | \<gamma> @ \<sigma> | left \<gamma> | right \<gamma>"}\\
+ − 402
& @{text "|"} & @{text "\<gamma>\<^isub>1 \<sim> \<gamma>\<^isub>2 | rightc \<gamma> | leftc \<gamma> | \<gamma>\<^isub>1 \<triangleright> \<gamma>\<^isub>2"}\smallskip\\
1690
+ − 403
\multicolumn{3}{@ {}l}{Terms}\\
1699
+ − 404
@{text "e"} & @{text "::="} & @{text "x | K | \<Lambda>a:\<kappa>. e | \<Lambda>c:\<iota>. e | e \<sigma> | e \<gamma>"}\\
+ − 405
& @{text "|"} & @{text "\<lambda>x:\<sigma>. e | e\<^isub>1 e\<^isub>2 | \<LET> x:\<sigma> = e\<^isub>1 \<IN> e\<^isub>2"}\\
+ − 406
& @{text "|"} & @{text "\<CASE> e\<^isub>1 \<OF>"}$\;\overline{@{text "p \<rightarrow> e\<^isub>2"}}$ @{text "| e \<triangleright> \<gamma>"}\smallskip\\
1690
+ − 407
\multicolumn{3}{@ {}l}{Patterns}\\
1699
+ − 408
@{text "p"} & @{text "::="} & @{text "K"}$\;\overline{@{text "a:\<kappa>"}}\;\overline{@{text "c:\<iota>"}}\;\overline{@{text "x:\<sigma>"}}$\smallskip\\
1690
+ − 409
\multicolumn{3}{@ {}l}{Constants}\\
1699
+ − 410
& @{text C} & coercion constants\\
+ − 411
& @{text T} & value type constructors\\
+ − 412
& @{text "S\<^isub>n"} & n-ary type functions (which need to be fully applied)\\
+ − 413
& @{text K} & data constructors\smallskip\\
1690
+ − 414
\multicolumn{3}{@ {}l}{Variables}\\
1699
+ − 415
& @{text a} & type variables\\
+ − 416
& @{text c} & coercion variables\\
+ − 417
& @{text x} & term variables\\
1687
+ − 418
\end{tabular}
+ − 419
\end{center}
+ − 420
\end{boxedminipage}
2345
+ − 421
\caption{The System @{text "F\<^isub>C"}
1699
+ − 422
\cite{CoreHaskell}, also often referred to as \emph{Core-Haskell}. In this
2345
+ − 423
version of @{text "F\<^isub>C"} we made a modification by separating the
1711
+ − 424
grammars for type kinds and coercion kinds, as well as for types and coercion
1702
+ − 425
types. For this paper the interesting term-constructor is @{text "\<CASE>"},
+ − 426
which binds multiple type-, coercion- and term-variables.\label{corehas}}
1667
+ − 427
\end{figure}
1485
+ − 428
*}
+ − 429
1493
+ − 430
section {* A Short Review of the Nominal Logic Work *}
+ − 431
+ − 432
text {*
1556
+ − 433
At its core, Nominal Isabelle is an adaption of the nominal logic work by
+ − 434
Pitts \cite{Pitts03}. This adaptation for Isabelle/HOL is described in
1694
+ − 435
\cite{HuffmanUrban10} (including proofs). We shall briefly review this work
+ − 436
to aid the description of what follows.
+ − 437
1711
+ − 438
Two central notions in the nominal logic work are sorted atoms and
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 439
sort-respecting permutations of atoms. We will use the letters @{text "a,
1711
+ − 440
b, c, \<dots>"} to stand for atoms and @{text "p, q, \<dots>"} to stand for
2347
+ − 441
permutations. The purpose of atoms is to represent variables, be they bound or free.
+ − 442
The sorts of atoms can be used to represent different kinds of
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 443
variables, such as the term-, coercion- and type-variables in Core-Haskell.
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 444
It is assumed that there is an infinite supply of atoms for each
1847
+ − 445
sort. However, in the interest of brevity, we shall restrict ourselves
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 446
in what follows to only one sort of atoms.
1493
+ − 447
+ − 448
Permutations are bijective functions from atoms to atoms that are
+ − 449
the identity everywhere except on a finite number of atoms. There is a
+ − 450
two-place permutation operation written
1617
+ − 451
%
1703
+ − 452
\begin{center}
+ − 453
@{text "_ \<bullet> _ :: perm \<Rightarrow> \<beta> \<Rightarrow> \<beta>"}
+ − 454
\end{center}
1493
+ − 455
+ − 456
\noindent
1628
+ − 457
in which the generic type @{text "\<beta>"} stands for the type of the object
1694
+ − 458
over which the permutation
1617
+ − 459
acts. In Nominal Isabelle, the identity permutation is written as @{term "0::perm"},
1690
+ − 460
the composition of two permutations @{term p} and @{term q} as \mbox{@{term "p + q"}},
1570
+ − 461
and the inverse permutation of @{term p} as @{text "- p"}. The permutation
1890
+ − 462
operation is defined by induction over the type-hierarchy \cite{HuffmanUrban10};
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 463
for example permutations acting on products, lists, sets, functions and booleans is
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 464
given by:
1702
+ − 465
%
1703
+ − 466
\begin{equation}\label{permute}
1694
+ − 467
\mbox{\begin{tabular}{@ {}cc@ {}}
1690
+ − 468
\begin{tabular}{@ {}l@ {}}
+ − 469
@{thm permute_prod.simps[no_vars, THEN eq_reflection]}\\[2mm]
+ − 470
@{thm permute_list.simps(1)[no_vars, THEN eq_reflection]}\\
+ − 471
@{thm permute_list.simps(2)[no_vars, THEN eq_reflection]}\\
+ − 472
\end{tabular} &
+ − 473
\begin{tabular}{@ {}l@ {}}
+ − 474
@{thm permute_set_eq[no_vars, THEN eq_reflection]}\\
1694
+ − 475
@{text "p \<bullet> f \<equiv> \<lambda>x. p \<bullet> (f (- p \<bullet> x))"}\\
1690
+ − 476
@{thm permute_bool_def[no_vars, THEN eq_reflection]}\\
+ − 477
\end{tabular}
1694
+ − 478
\end{tabular}}
+ − 479
\end{equation}
1690
+ − 480
+ − 481
\noindent
1730
+ − 482
Concrete permutations in Nominal Isabelle are built up from swappings,
+ − 483
written as \mbox{@{text "(a b)"}}, which are permutations that behave
+ − 484
as follows:
1617
+ − 485
%
1703
+ − 486
\begin{center}
+ − 487
@{text "(a b) = \<lambda>c. if a = c then b else if b = c then a else c"}
+ − 488
\end{center}
+ − 489
1570
+ − 490
The most original aspect of the nominal logic work of Pitts is a general
1703
+ − 491
definition for the notion of the ``set of free variables of an object @{text
1570
+ − 492
"x"}''. This notion, written @{term "supp x"}, is general in the sense that
2341
+ − 493
it applies not only to lambda-terms ($\alpha$-equated or not), but also to lists,
1570
+ − 494
products, sets and even functions. The definition depends only on the
+ − 495
permutation operation and on the notion of equality defined for the type of
+ − 496
@{text x}, namely:
1617
+ − 497
%
1703
+ − 498
\begin{equation}\label{suppdef}
+ − 499
@{thm supp_def[no_vars, THEN eq_reflection]}
+ − 500
\end{equation}
1493
+ − 501
+ − 502
\noindent
+ − 503
There is also the derived notion for when an atom @{text a} is \emph{fresh}
+ − 504
for an @{text x}, defined as
1617
+ − 505
%
1703
+ − 506
\begin{center}
+ − 507
@{thm fresh_def[no_vars]}
+ − 508
\end{center}
1493
+ − 509
+ − 510
\noindent
1954
+ − 511
We use for sets of atoms the abbreviation
1703
+ − 512
@{thm (lhs) fresh_star_def[no_vars]}, defined as
1517
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 513
@{thm (rhs) fresh_star_def[no_vars]}.
1493
+ − 514
A striking consequence of these definitions is that we can prove
+ − 515
without knowing anything about the structure of @{term x} that
2140
+ − 516
swapping two fresh atoms, say @{text a} and @{text b}, leaves
+ − 517
@{text x} unchanged:
1506
+ − 518
1711
+ − 519
\begin{property}\label{swapfreshfresh}
1506
+ − 520
@{thm[mode=IfThen] swap_fresh_fresh[no_vars]}
1517
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 521
\end{property}
1506
+ − 522
1711
+ − 523
While often the support of an object can be relatively easily
1730
+ − 524
described, for example for atoms, products, lists, function applications,
2341
+ − 525
booleans and permutations as follows
1690
+ − 526
%
+ − 527
\begin{eqnarray}
1703
+ − 528
@{term "supp a"} & = & @{term "{a}"}\\
1690
+ − 529
@{term "supp (x, y)"} & = & @{term "supp x \<union> supp y"}\\
+ − 530
@{term "supp []"} & = & @{term "{}"}\\
1711
+ − 531
@{term "supp (x#xs)"} & = & @{term "supp x \<union> supp xs"}\\
1730
+ − 532
@{text "supp (f x)"} & @{text "\<subseteq>"} & @{term "supp f \<union> supp x"}\label{suppfun}\\
1703
+ − 533
@{term "supp b"} & = & @{term "{}"}\\
+ − 534
@{term "supp p"} & = & @{term "{a. p \<bullet> a \<noteq> a}"}
1690
+ − 535
\end{eqnarray}
+ − 536
+ − 537
\noindent
2347
+ − 538
in some cases it can be difficult to characterise the support precisely, and
1730
+ − 539
only an approximation can be established (see \eqref{suppfun} above). Reasoning about
+ − 540
such approximations can be simplified with the notion \emph{supports}, defined
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 541
as follows:
1693
+ − 542
+ − 543
\begin{defn}
+ − 544
A set @{text S} \emph{supports} @{text x} if for all atoms @{text a} and @{text b}
+ − 545
not in @{text S} we have @{term "(a \<rightleftharpoons> b) \<bullet> x = x"}.
+ − 546
\end{defn}
1690
+ − 547
1693
+ − 548
\noindent
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 549
The main point of @{text supports} is that we can establish the following
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 550
two properties.
1693
+ − 551
1703
+ − 552
\begin{property}\label{supportsprop}
2341
+ − 553
Given a set @{text "as"} of atoms.
+ − 554
{\it i)} @{thm[mode=IfThen] supp_is_subset[where S="as", no_vars]}
1693
+ − 555
{\it ii)} @{thm supp_supports[no_vars]}.
+ − 556
\end{property}
+ − 557
+ − 558
Another important notion in the nominal logic work is \emph{equivariance}.
1703
+ − 559
For a function @{text f}, say of type @{text "\<alpha> \<Rightarrow> \<beta>"}, to be equivariant
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 560
it is required that every permutation leaves @{text f} unchanged, that is
1711
+ − 561
%
+ − 562
\begin{equation}\label{equivariancedef}
+ − 563
@{term "\<forall>p. p \<bullet> f = f"}
+ − 564
\end{equation}
+ − 565
+ − 566
\noindent or equivalently that a permutation applied to the application
1730
+ − 567
@{text "f x"} can be moved to the argument @{text x}. That means for equivariant
2341
+ − 568
functions @{text f}, we have for all permutations @{text p}:
1703
+ − 569
%
+ − 570
\begin{equation}\label{equivariance}
1711
+ − 571
@{text "p \<bullet> f = f"} \;\;\;\textit{if and only if}\;\;\;
+ − 572
@{text "p \<bullet> (f x) = f (p \<bullet> x)"}
1703
+ − 573
\end{equation}
1694
+ − 574
+ − 575
\noindent
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 576
From property \eqref{equivariancedef} and the definition of @{text supp}, we
2175
+ − 577
can easily deduce that equivariant functions have empty support. There is
1771
+ − 578
also a similar notion for equivariant relations, say @{text R}, namely the property
+ − 579
that
+ − 580
%
+ − 581
\begin{center}
2341
+ − 582
@{text "x R y"} \;\;\textit{implies}\;\; @{text "(p \<bullet> x) R (p \<bullet> y)"}
1771
+ − 583
\end{center}
1711
+ − 584
2343
+ − 585
Finally, the nominal logic work provides us with general means for renaming
1711
+ − 586
binders. While in the older version of Nominal Isabelle, we used extensively
2343
+ − 587
Property~\ref{swapfreshfresh} to rename single binders, this property
2341
+ − 588
proved too unwieldy for dealing with multiple binders. For such binders the
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 589
following generalisations turned out to be easier to use.
1711
+ − 590
+ − 591
\begin{property}\label{supppermeq}
+ − 592
@{thm[mode=IfThen] supp_perm_eq[no_vars]}
+ − 593
\end{property}
1517
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 594
1747
+ − 595
\begin{property}\label{avoiding}
1716
+ − 596
For a finite set @{text as} and a finitely supported @{text x} with
+ − 597
@{term "as \<sharp>* x"} and also a finitely supported @{text c}, there
+ − 598
exists a permutation @{text p} such that @{term "(p \<bullet> as) \<sharp>* c"} and
1711
+ − 599
@{term "supp x \<sharp>* p"}.
+ − 600
\end{property}
+ − 601
+ − 602
\noindent
1716
+ − 603
The idea behind the second property is that given a finite set @{text as}
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 604
of binders (being bound, or fresh, in @{text x} is ensured by the
1716
+ − 605
assumption @{term "as \<sharp>* x"}), then there exists a permutation @{text p} such that
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 606
the renamed binders @{term "p \<bullet> as"} avoid @{text c} (which can be arbitrarily chosen
1730
+ − 607
as long as it is finitely supported) and also @{text "p"} does not affect anything
1711
+ − 608
in the support of @{text x} (that is @{term "supp x \<sharp>* p"}). The last
+ − 609
fact and Property~\ref{supppermeq} allow us to ``rename'' just the binders
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 610
@{text as} in @{text x}, because @{term "p \<bullet> x = x"}.
1711
+ − 611
2128
+ − 612
Most properties given in this section are described in detail in \cite{HuffmanUrban10}
1737
+ − 613
and of course all are formalised in Isabelle/HOL. In the next sections we will make
2341
+ − 614
extensive use of these properties in order to define $\alpha$-equivalence in
1737
+ − 615
the presence of multiple binders.
1493
+ − 616
*}
+ − 617
1485
+ − 618
2345
+ − 619
section {* General Bindings\label{sec:binders} *}
1485
+ − 620
1517
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 621
text {*
1587
+ − 622
In Nominal Isabelle, the user is expected to write down a specification of a
+ − 623
term-calculus and then a reasoning infrastructure is automatically derived
1617
+ − 624
from this specification (remember that Nominal Isabelle is a definitional
1587
+ − 625
extension of Isabelle/HOL, which does not introduce any new axioms).
1579
+ − 626
1657
+ − 627
In order to keep our work with deriving the reasoning infrastructure
+ − 628
manageable, we will wherever possible state definitions and perform proofs
2341
+ − 629
on the ``user-level'' of Isabelle/HOL, as opposed to write custom ML-code that
1657
+ − 630
generates them anew for each specification. To that end, we will consider
+ − 631
first pairs @{text "(as, x)"} of type @{text "(atom set) \<times> \<beta>"}. These pairs
2128
+ − 632
are intended to represent the abstraction, or binding, of the set of atoms @{text
1657
+ − 633
"as"} in the body @{text "x"}.
1570
+ − 634
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 635
The first question we have to answer is when two pairs @{text "(as, x)"} and
2341
+ − 636
@{text "(bs, y)"} are $\alpha$-equivalent? (For the moment we are interested in
+ − 637
the notion of $\alpha$-equivalence that is \emph{not} preserved by adding
+ − 638
vacuous binders.) To answer this question, we identify four conditions: {\it (i)}
2347
+ − 639
given a free-atom function @{text "fa"} of type \mbox{@{text "\<beta> \<Rightarrow> atom
1657
+ − 640
set"}}, then @{text x} and @{text y} need to have the same set of free
2348
+ − 641
atoms; moreover there must be a permutation @{text p} such that {\it
2347
+ − 642
(ii)} @{text p} leaves the free atoms of @{text x} and @{text y} unchanged, but
2341
+ − 643
{\it (iii)} ``moves'' their bound names so that we obtain modulo a relation,
+ − 644
say \mbox{@{text "_ R _"}}, two equivalent terms. We also require that {\it (iv)}
1662
+ − 645
@{text p} makes the sets of abstracted atoms @{text as} and @{text bs} equal. The
2343
+ − 646
requirements {\it (i)} to {\it (iv)} can be stated formally as follows:
1556
+ − 647
%
1572
+ − 648
\begin{equation}\label{alphaset}
2341
+ − 649
\begin{array}{@ {\hspace{10mm}}r@ {\hspace{2mm}}l@ {\hspace{4mm}}r}
2347
+ − 650
\multicolumn{3}{l}{@{term "(as, x) \<approx>gen R fa p (bs, y)"}\hspace{2mm}@{text "\<equiv>"}}\\[1mm]
+ − 651
& @{term "fa(x) - as = fa(y) - bs"} & \mbox{\it (i)}\\
+ − 652
@{text "\<and>"} & @{term "(fa(x) - as) \<sharp>* p"} & \mbox{\it (ii)}\\
2341
+ − 653
@{text "\<and>"} & @{text "(p \<bullet> x) R y"} & \mbox{\it (iii)}\\
+ − 654
@{text "\<and>"} & @{term "(p \<bullet> as) = bs"} & \mbox{\it (iv)}\\
1572
+ − 655
\end{array}
1556
+ − 656
\end{equation}
+ − 657
+ − 658
\noindent
2175
+ − 659
Note that this relation depends on the permutation @{text
2341
+ − 660
"p"}; $\alpha$-equivalence between two pairs is then the relation where we
1657
+ − 661
existentially quantify over this @{text "p"}. Also note that the relation is
2347
+ − 662
dependent on a free-atom function @{text "fa"} and a relation @{text
1657
+ − 663
"R"}. The reason for this extra generality is that we will use
2341
+ − 664
$\approx_{\,\textit{set}}$ for both ``raw'' terms and $\alpha$-equated terms. In
+ − 665
the latter case, @{text R} will be replaced by equality @{text "="} and we
2347
+ − 666
will prove that @{text "fa"} is equal to @{text "supp"}.
1572
+ − 667
+ − 668
The definition in \eqref{alphaset} does not make any distinction between the
2347
+ − 669
order of abstracted atoms. If we want this, then we can define $\alpha$-equivalence
1579
+ − 670
for pairs of the form \mbox{@{text "(as, x)"}} with type @{text "(atom list) \<times> \<beta>"}
+ − 671
as follows
1572
+ − 672
%
+ − 673
\begin{equation}\label{alphalist}
2341
+ − 674
\begin{array}{@ {\hspace{10mm}}r@ {\hspace{2mm}}l@ {\hspace{4mm}}r}
2347
+ − 675
\multicolumn{2}{l}{@{term "(as, x) \<approx>lst R fa p (bs, y)"}\hspace{2mm}@{text "\<equiv>"}}\\[1mm]
+ − 676
& @{term "fa(x) - (set as) = fa(y) - (set bs)"} & \mbox{\it (i)}\\
+ − 677
\wedge & @{term "(fa(x) - set as) \<sharp>* p"} & \mbox{\it (ii)}\\
2341
+ − 678
\wedge & @{text "(p \<bullet> x) R y"} & \mbox{\it (iii)}\\
+ − 679
\wedge & @{term "(p \<bullet> as) = bs"} & \mbox{\it (iv)}\\
1572
+ − 680
\end{array}
+ − 681
\end{equation}
+ − 682
+ − 683
\noindent
2341
+ − 684
where @{term set} is the function that coerces a list of atoms into a set of atoms.
1752
+ − 685
Now the last clause ensures that the order of the binders matters (since @{text as}
+ − 686
and @{text bs} are lists of atoms).
1556
+ − 687
1657
+ − 688
If we do not want to make any difference between the order of binders \emph{and}
1579
+ − 689
also allow vacuous binders, then we keep sets of binders, but drop the fourth
+ − 690
condition in \eqref{alphaset}:
1572
+ − 691
%
1579
+ − 692
\begin{equation}\label{alphares}
2341
+ − 693
\begin{array}{@ {\hspace{10mm}}r@ {\hspace{2mm}}l@ {\hspace{4mm}}r}
2347
+ − 694
\multicolumn{2}{l}{@{term "(as, x) \<approx>res R fa p (bs, y)"}\hspace{2mm}@{text "\<equiv>"}}\\[1mm]
+ − 695
& @{term "fa(x) - as = fa(y) - bs"} & \mbox{\it (i)}\\
+ − 696
\wedge & @{term "(fa(x) - as) \<sharp>* p"} & \mbox{\it (ii)}\\
2341
+ − 697
\wedge & @{text "(p \<bullet> x) R y"} & \mbox{\it (iii)}\\
1572
+ − 698
\end{array}
+ − 699
\end{equation}
1556
+ − 700
2345
+ − 701
It might be useful to consider first some examples about how these definitions
2341
+ − 702
of $\alpha$-equivalence pan out in practice. For this consider the case of
2347
+ − 703
abstracting a set of atoms over types (as in type-schemes). We set
+ − 704
@{text R} to be the usual equality @{text "="} and for @{text "fa(T)"} we
2341
+ − 705
define
1572
+ − 706
+ − 707
\begin{center}
2347
+ − 708
@{text "fa(x) = {x}"} \hspace{5mm} @{text "fa(T\<^isub>1 \<rightarrow> T\<^isub>2) = fa(T\<^isub>1) \<union> fa(T\<^isub>2)"}
1572
+ − 709
\end{center}
+ − 710
+ − 711
\noindent
1657
+ − 712
Now recall the examples shown in \eqref{ex1}, \eqref{ex2} and
1687
+ − 713
\eqref{ex3}. It can be easily checked that @{text "({x, y}, x \<rightarrow> y)"} and
2341
+ − 714
@{text "({y, x}, y \<rightarrow> x)"} are $\alpha$-equivalent according to
+ − 715
$\approx_{\,\textit{set}}$ and $\approx_{\,\textit{res}}$ by taking @{text p} to
2175
+ − 716
be the swapping @{term "(x \<rightleftharpoons> y)"}. In case of @{text "x \<noteq> y"}, then @{text
2341
+ − 717
"([x, y], x \<rightarrow> y)"} $\not\approx_{\,\textit{list}}$ @{text "([y, x], x \<rightarrow> y)"}
2175
+ − 718
since there is no permutation that makes the lists @{text "[x, y]"} and
+ − 719
@{text "[y, x]"} equal, and also leaves the type \mbox{@{text "x \<rightarrow> y"}}
2341
+ − 720
unchanged. Another example is @{text "({x}, x)"} $\approx_{\,\textit{res}}$
2175
+ − 721
@{text "({x, y}, x)"} which holds by taking @{text p} to be the identity
+ − 722
permutation. However, if @{text "x \<noteq> y"}, then @{text "({x}, x)"}
2341
+ − 723
$\not\approx_{\,\textit{set}}$ @{text "({x, y}, x)"} since there is no
2175
+ − 724
permutation that makes the sets @{text "{x}"} and @{text "{x, y}"} equal
2341
+ − 725
(similarly for $\approx_{\,\textit{list}}$). It can also relatively easily be
+ − 726
shown that all three notions of $\alpha$-equivalence coincide, if we only
2175
+ − 727
abstract a single atom.
1579
+ − 728
1730
+ − 729
In the rest of this section we are going to introduce three abstraction
+ − 730
types. For this we define
1657
+ − 731
%
+ − 732
\begin{equation}
+ − 733
@{term "abs_set (as, x) (bs, x) \<equiv> \<exists>p. alpha_gen (as, x) equal supp p (bs, x)"}
+ − 734
\end{equation}
+ − 735
1579
+ − 736
\noindent
2341
+ − 737
(similarly for $\approx_{\,\textit{abs\_res}}$
+ − 738
and $\approx_{\,\textit{abs\_list}}$). We can show that these relations are equivalence
1687
+ − 739
relations and equivariant.
1579
+ − 740
1739
+ − 741
\begin{lemma}\label{alphaeq}
2341
+ − 742
The relations $\approx_{\,\textit{abs\_set}}$, $\approx_{\,\textit{abs\_list}}$
+ − 743
and $\approx_{\,\textit{abs\_res}}$ are equivalence relations, and if @{term
1739
+ − 744
"abs_set (as, x) (bs, y)"} then also @{term "abs_set (p \<bullet> as, p \<bullet> x) (p \<bullet>
+ − 745
bs, p \<bullet> y)"} (similarly for the other two relations).
1657
+ − 746
\end{lemma}
+ − 747
+ − 748
\begin{proof}
+ − 749
Reflexivity is by taking @{text "p"} to be @{text "0"}. For symmetry we have
+ − 750
a permutation @{text p} and for the proof obligation take @{term "-p"}. In case
1662
+ − 751
of transitivity, we have two permutations @{text p} and @{text q}, and for the
+ − 752
proof obligation use @{text "q + p"}. All conditions are then by simple
1657
+ − 753
calculations.
+ − 754
\end{proof}
+ − 755
+ − 756
\noindent
2343
+ − 757
This lemma allows us to use our quotient package for introducing
1662
+ − 758
new types @{text "\<beta> abs_set"}, @{text "\<beta> abs_res"} and @{text "\<beta> abs_list"}
2341
+ − 759
representing $\alpha$-equivalence classes of pairs of type
2128
+ − 760
@{text "(atom set) \<times> \<beta>"} (in the first two cases) and of type @{text "(atom list) \<times> \<beta>"}
+ − 761
(in the third case).
1954
+ − 762
The elements in these types will be, respectively, written as:
1657
+ − 763
+ − 764
\begin{center}
+ − 765
@{term "Abs as x"} \hspace{5mm}
1954
+ − 766
@{term "Abs_res as x"} \hspace{5mm}
+ − 767
@{term "Abs_lst as x"}
1657
+ − 768
\end{center}
+ − 769
1662
+ − 770
\noindent
1859
+ − 771
indicating that a set (or list) of atoms @{text as} is abstracted in @{text x}. We will
1716
+ − 772
call the types \emph{abstraction types} and their elements
1752
+ − 773
\emph{abstractions}. The important property we need to derive is the support of
1737
+ − 774
abstractions, namely:
1662
+ − 775
1687
+ − 776
\begin{thm}[Support of Abstractions]\label{suppabs}
1703
+ − 777
Assuming @{text x} has finite support, then\\[-6mm]
1662
+ − 778
\begin{center}
1687
+ − 779
\begin{tabular}{l@ {\hspace{2mm}}c@ {\hspace{2mm}}l}
+ − 780
@{thm (lhs) supp_abs(1)[no_vars]} & $=$ & @{thm (rhs) supp_abs(1)[no_vars]}\\
1954
+ − 781
@{thm (lhs) supp_abs(2)[no_vars]} & $=$ & @{thm (rhs) supp_abs(2)[no_vars]}\\
+ − 782
@{thm (lhs) supp_abs(3)[where bs="as", no_vars]} & $=$ & @{thm (rhs) supp_abs(3)[where bs="as", no_vars]}
1687
+ − 783
\end{tabular}
1662
+ − 784
\end{center}
1687
+ − 785
\end{thm}
1662
+ − 786
+ − 787
\noindent
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 788
Below we will show the first equation. The others
1730
+ − 789
follow by similar arguments. By definition of the abstraction type @{text "abs_set"}
1687
+ − 790
we have
+ − 791
%
+ − 792
\begin{equation}\label{abseqiff}
1703
+ − 793
@{thm (lhs) abs_eq_iff(1)[where bs="as" and cs="bs", no_vars]} \;\;\text{if and only if}\;\;
1687
+ − 794
@{thm (rhs) abs_eq_iff(1)[where bs="as" and cs="bs", no_vars]}
+ − 795
\end{equation}
+ − 796
+ − 797
\noindent
1703
+ − 798
and also
+ − 799
%
2128
+ − 800
\begin{equation}\label{absperm}
1703
+ − 801
@{thm permute_Abs[no_vars]}
+ − 802
\end{equation}
1662
+ − 803
1703
+ − 804
\noindent
1716
+ − 805
The second fact derives from the definition of permutations acting on pairs
2341
+ − 806
\eqref{permute} and $\alpha$-equivalence being equivariant
1716
+ − 807
(see Lemma~\ref{alphaeq}). With these two facts at our disposal, we can show
2341
+ − 808
the following lemma about swapping two atoms in an abstraction.
1703
+ − 809
1662
+ − 810
\begin{lemma}
1716
+ − 811
@{thm[mode=IfThen] abs_swap1(1)[where bs="as", no_vars]}
1662
+ − 812
\end{lemma}
+ − 813
+ − 814
\begin{proof}
1730
+ − 815
This lemma is straightforward using \eqref{abseqiff} and observing that
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 816
the assumptions give us @{term "(a \<rightleftharpoons> b) \<bullet> (supp x - as) = (supp x - as)"}.
1730
+ − 817
Moreover @{text supp} and set difference are equivariant (see \cite{HuffmanUrban10}).
1662
+ − 818
\end{proof}
1587
+ − 819
1687
+ − 820
\noindent
2163
+ − 821
Assuming that @{text "x"} has finite support, this lemma together
+ − 822
with \eqref{absperm} allows us to show
1687
+ − 823
%
+ − 824
\begin{equation}\label{halfone}
+ − 825
@{thm abs_supports(1)[no_vars]}
+ − 826
\end{equation}
+ − 827
+ − 828
\noindent
1716
+ − 829
which by Property~\ref{supportsprop} gives us ``one half'' of
1752
+ − 830
Theorem~\ref{suppabs}. The ``other half'' is a bit more involved. To establish
1716
+ − 831
it, we use a trick from \cite{Pitts04} and first define an auxiliary
1737
+ − 832
function @{text aux}, taking an abstraction as argument:
1687
+ − 833
%
+ − 834
\begin{center}
1703
+ − 835
@{thm supp_gen.simps[THEN eq_reflection, no_vars]}
1687
+ − 836
\end{center}
+ − 837
1703
+ − 838
\noindent
+ − 839
Using the second equation in \eqref{equivariance}, we can show that
1716
+ − 840
@{text "aux"} is equivariant (since @{term "p \<bullet> (supp x - as) =
+ − 841
(supp (p \<bullet> x)) - (p \<bullet> as)"}) and therefore has empty support.
+ − 842
This in turn means
1703
+ − 843
%
+ − 844
\begin{center}
1716
+ − 845
@{term "supp (supp_gen (Abs as x)) \<subseteq> supp (Abs as x)"}
1703
+ − 846
\end{center}
1687
+ − 847
+ − 848
\noindent
1954
+ − 849
using \eqref{suppfun}. Assuming @{term "supp x - as"} is a finite set,
1716
+ − 850
we further obtain
1703
+ − 851
%
+ − 852
\begin{equation}\label{halftwo}
+ − 853
@{thm (concl) supp_abs_subset1(1)[no_vars]}
+ − 854
\end{equation}
+ − 855
+ − 856
\noindent
1737
+ − 857
since for finite sets of atoms, @{text "bs"}, we have
+ − 858
@{thm (concl) supp_finite_atom_set[where S="bs", no_vars]}.
+ − 859
Finally, taking \eqref{halfone} and \eqref{halftwo} together establishes
+ − 860
Theorem~\ref{suppabs}.
1703
+ − 861
1737
+ − 862
The method of first considering abstractions of the
1956
+ − 863
form @{term "Abs as x"} etc is motivated by the fact that
+ − 864
we can conveniently establish at the Isabelle/HOL level
+ − 865
properties about them. It would be
+ − 866
laborious to write custom ML-code that derives automatically such properties
1730
+ − 867
for every term-constructor that binds some atoms. Also the generality of
2341
+ − 868
the definitions for $\alpha$-equivalence will help us in the next section.
1517
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 869
*}
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 870
2345
+ − 871
section {* Specifying General Bindings\label{sec:spec} *}
1491
+ − 872
1520
+ − 873
text {*
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 874
Our choice of syntax for specifications is influenced by the existing
1765
+ − 875
datatype package of Isabelle/HOL \cite{Berghofer99} and by the syntax of the
+ − 876
Ott-tool \cite{ott-jfp}. For us a specification of a term-calculus is a
+ − 877
collection of (possibly mutual recursive) type declarations, say @{text
+ − 878
"ty\<AL>\<^isub>1, \<dots>, ty\<AL>\<^isub>n"}, and an associated collection of
+ − 879
binding functions, say @{text "bn\<AL>\<^isub>1, \<dots>, bn\<AL>\<^isub>m"}. The
+ − 880
syntax in Nominal Isabelle for such specifications is roughly as follows:
1628
+ − 881
%
1619
+ − 882
\begin{equation}\label{scheme}
1636
+ − 883
\mbox{\begin{tabular}{@ {\hspace{-5mm}}p{1.8cm}l}
1617
+ − 884
type \mbox{declaration part} &
1611
+ − 885
$\begin{cases}
+ − 886
\mbox{\begin{tabular}{l}
1765
+ − 887
\isacommand{nominal\_datatype} @{text "ty\<AL>\<^isub>1 = \<dots>"}\\
+ − 888
\isacommand{and} @{text "ty\<AL>\<^isub>2 = \<dots>"}\\
1587
+ − 889
$\ldots$\\
1765
+ − 890
\isacommand{and} @{text "ty\<AL>\<^isub>n = \<dots>"}\\
1611
+ − 891
\end{tabular}}
+ − 892
\end{cases}$\\
1617
+ − 893
binding \mbox{function part} &
1611
+ − 894
$\begin{cases}
+ − 895
\mbox{\begin{tabular}{l}
1954
+ − 896
\isacommand{binder} @{text "bn\<AL>\<^isub>1"} \isacommand{and} \ldots \isacommand{and} @{text "bn\<AL>\<^isub>m"}\\
1611
+ − 897
\isacommand{where}\\
1587
+ − 898
$\ldots$\\
1611
+ − 899
\end{tabular}}
+ − 900
\end{cases}$\\
1619
+ − 901
\end{tabular}}
+ − 902
\end{equation}
1587
+ − 903
+ − 904
\noindent
1637
+ − 905
Every type declaration @{text ty}$^\alpha_{1..n}$ consists of a collection of
2341
+ − 906
term-constructors, each of which comes with a list of labelled
1620
+ − 907
types that stand for the types of the arguments of the term-constructor.
1765
+ − 908
For example a term-constructor @{text "C\<^sup>\<alpha>"} might be specified with
1611
+ − 909
+ − 910
\begin{center}
1637
+ − 911
@{text "C\<^sup>\<alpha> label\<^isub>1::ty"}$'_1$ @{text "\<dots> label\<^isub>l::ty"}$'_l\;\;$ @{text "binding_clauses"}
1611
+ − 912
\end{center}
1587
+ − 913
1611
+ − 914
\noindent
2128
+ − 915
whereby some of the @{text ty}$'_{1..l}$ (or their components) can be contained
1730
+ − 916
in the collection of @{text ty}$^\alpha_{1..n}$ declared in
1737
+ − 917
\eqref{scheme}.
1765
+ − 918
In this case we will call the corresponding argument a
+ − 919
\emph{recursive argument} of @{text "C\<^sup>\<alpha>"}.
+ − 920
%The types of such recursive
1737
+ − 921
%arguments need to satisfy a ``positivity''
+ − 922
%restriction, which ensures that the type has a set-theoretic semantics
+ − 923
%\cite{Berghofer99}.
+ − 924
The labels
1730
+ − 925
annotated on the types are optional. Their purpose is to be used in the
+ − 926
(possibly empty) list of \emph{binding clauses}, which indicate the binders
+ − 927
and their scope in a term-constructor. They come in three \emph{modes}:
1587
+ − 928
1611
+ − 929
\begin{center}
1617
+ − 930
\begin{tabular}{l}
2343
+ − 931
\isacommand{bind}\; {\it binders}\; \isacommand{in}\; {\it bodies}\\
+ − 932
\isacommand{bind\_set}\; {\it binders}\; \isacommand{in}\; {\it bodies}\\
+ − 933
\isacommand{bind\_res}\; {\it binders}\; \isacommand{in}\; {\it bodies}\\
1617
+ − 934
\end{tabular}
1611
+ − 935
\end{center}
+ − 936
+ − 937
\noindent
1730
+ − 938
The first mode is for binding lists of atoms (the order of binders matters);
+ − 939
the second is for sets of binders (the order does not matter, but the
+ − 940
cardinality does) and the last is for sets of binders (with vacuous binders
2359
+ − 941
preserving $\alpha$-equivalence). As indicated, the labels in the ``\isacommand{in}-part'' of a binding
2343
+ − 942
clause will be called \emph{bodies}; the
2163
+ − 943
``\isacommand{bind}-part'' will be called \emph{binders}. In contrast to
+ − 944
Ott, we allow multiple labels in binders and bodies. For example we allow
+ − 945
binding clauses of the form:
1956
+ − 946
+ − 947
\begin{center}
2156
+ − 948
\begin{tabular}{@ {}ll@ {}}
2341
+ − 949
@{text "Foo\<^isub>1 x::name y::name t::trm s::trm"} &
2156
+ − 950
\isacommand{bind} @{text "x y"} \isacommand{in} @{text "t s"}\\
2341
+ − 951
@{text "Foo\<^isub>2 x::name y::name t::trm s::trm"} &
2156
+ − 952
\isacommand{bind} @{text "x y"} \isacommand{in} @{text "t"},
+ − 953
\isacommand{bind} @{text "x y"} \isacommand{in} @{text "s"}\\
1956
+ − 954
\end{tabular}
+ − 955
\end{center}
+ − 956
+ − 957
\noindent
2343
+ − 958
Similarly for the other binding modes.
+ − 959
%Interestingly, in case of \isacommand{bind\_set}
+ − 960
%and \isacommand{bind\_res} the binding clauses above will make a difference to the semantics
+ − 961
%of the specifications (the corresponding $\alpha$-equivalence will differ). We will
+ − 962
%show this later with an example.
2140
+ − 963
2347
+ − 964
There are also some restrictions we need to impose on our binding clauses in comparison to
+ − 965
the ones of Ott. The
2343
+ − 966
main idea behind these restrictions is that we obtain a sensible notion of
2347
+ − 967
$\alpha$-equivalence where it is ensured that within a given scope an
2348
+ − 968
atom occurrence cannot be both bound and free at the same time. The first
2344
+ − 969
restriction is that a body can only occur in
2343
+ − 970
\emph{one} binding clause of a term constructor (this ensures that the bound
2347
+ − 971
atoms of a body cannot be free at the same time by specifying an
2344
+ − 972
alternative binder for the same body). For binders we distinguish between
2343
+ − 973
\emph{shallow} and \emph{deep} binders. Shallow binders are just
+ − 974
labels. The restriction we need to impose on them is that in case of
+ − 975
\isacommand{bind\_set} and \isacommand{bind\_res} the labels must either
+ − 976
refer to atom types or to sets of atom types; in case of \isacommand{bind}
+ − 977
the labels must refer to atom types or lists of atom types. Two examples for
+ − 978
the use of shallow binders are the specification of lambda-terms, where a
+ − 979
single name is bound, and type-schemes, where a finite set of names is
+ − 980
bound:
+ − 981
1611
+ − 982
+ − 983
\begin{center}
1612
+ − 984
\begin{tabular}{@ {}cc@ {}}
+ − 985
\begin{tabular}{@ {}l@ {\hspace{-1mm}}}
2341
+ − 986
\isacommand{nominal\_datatype} @{text lam} $=$\\
1719
+ − 987
\hspace{5mm}\phantom{$\mid$}~@{text "Var name"}\\
+ − 988
\hspace{5mm}$\mid$~@{text "App lam lam"}\\
+ − 989
\hspace{5mm}$\mid$~@{text "Lam x::name t::lam"}\\
+ − 990
\hspace{21mm}\isacommand{bind} @{text x} \isacommand{in} @{text t}\\
1611
+ − 991
\end{tabular} &
1612
+ − 992
\begin{tabular}{@ {}l@ {}}
2341
+ − 993
\isacommand{nominal\_datatype}~@{text ty} $=$\\
1719
+ − 994
\hspace{5mm}\phantom{$\mid$}~@{text "TVar name"}\\
+ − 995
\hspace{5mm}$\mid$~@{text "TFun ty ty"}\\
+ − 996
\isacommand{and}~@{text "tsc = All xs::(name fset) T::ty"}\\
+ − 997
\hspace{24mm}\isacommand{bind\_res} @{text xs} \isacommand{in} @{text T}\\
1611
+ − 998
\end{tabular}
+ − 999
\end{tabular}
+ − 1000
\end{center}
1587
+ − 1001
1612
+ − 1002
\noindent
2341
+ − 1003
In these specifications @{text "name"} refers to an atom type, and @{text
+ − 1004
"fset"} to the type of finite sets.
2156
+ − 1005
Note that for @{text lam} it does not matter which binding mode we use. The
+ − 1006
reason is that we bind only a single @{text name}. However, having
2175
+ − 1007
\isacommand{bind\_set} or \isacommand{bind} in the second case makes a
2345
+ − 1008
difference to the semantics of the specification (which we will define in the next section).
2156
+ − 1009
2128
+ − 1010
2134
+ − 1011
A \emph{deep} binder uses an auxiliary binding function that ``picks'' out
2156
+ − 1012
the atoms in one argument of the term-constructor, which can be bound in
+ − 1013
other arguments and also in the same argument (we will call such binders
2341
+ − 1014
\emph{recursive}, see below). The binding functions are
2156
+ − 1015
expected to return either a set of atoms (for \isacommand{bind\_set} and
+ − 1016
\isacommand{bind\_res}) or a list of atoms (for \isacommand{bind}). They can
2343
+ − 1017
be defined by recursion over the corresponding type; the equations
2156
+ − 1018
must be given in the binding function part of the scheme shown in
+ − 1019
\eqref{scheme}. For example a term-calculus containing @{text "Let"}s with
+ − 1020
tuple patterns might be specified as:
1764
+ − 1021
%
+ − 1022
\begin{equation}\label{letpat}
+ − 1023
\mbox{%
1619
+ − 1024
\begin{tabular}{l}
1719
+ − 1025
\isacommand{nominal\_datatype} @{text trm} =\\
+ − 1026
\hspace{5mm}\phantom{$\mid$}~@{term "Var name"}\\
+ − 1027
\hspace{5mm}$\mid$~@{term "App trm trm"}\\
+ − 1028
\hspace{5mm}$\mid$~@{text "Lam x::name t::trm"}
+ − 1029
\;\;\isacommand{bind} @{text x} \isacommand{in} @{text t}\\
+ − 1030
\hspace{5mm}$\mid$~@{text "Let p::pat trm t::trm"}
+ − 1031
\;\;\isacommand{bind} @{text "bn(p)"} \isacommand{in} @{text t}\\
+ − 1032
\isacommand{and} @{text pat} =\\
+ − 1033
\hspace{5mm}\phantom{$\mid$}~@{text PNil}\\
+ − 1034
\hspace{5mm}$\mid$~@{text "PVar name"}\\
+ − 1035
\hspace{5mm}$\mid$~@{text "PTup pat pat"}\\
1954
+ − 1036
\isacommand{binder}~@{text "bn::pat \<Rightarrow> atom list"}\\
1719
+ − 1037
\isacommand{where}~@{text "bn(PNil) = []"}\\
+ − 1038
\hspace{5mm}$\mid$~@{text "bn(PVar x) = [atom x]"}\\
2341
+ − 1039
\hspace{5mm}$\mid$~@{text "bn(PTup p\<^isub>1 p\<^isub>2) = bn(p\<^isub>1) @ bn(p\<^isub>2)"}\smallskip\\
1764
+ − 1040
\end{tabular}}
+ − 1041
\end{equation}
1617
+ − 1042
1619
+ − 1043
\noindent
2140
+ − 1044
In this specification the function @{text "bn"} determines which atoms of
2346
+ − 1045
the pattern @{text p} are bound in the argument @{text "t"}. Note that in the
2140
+ − 1046
second-last @{text bn}-clause the function @{text "atom"} coerces a name
+ − 1047
into the generic atom type of Nominal Isabelle \cite{HuffmanUrban10}. This
+ − 1048
allows us to treat binders of different atom type uniformly.
1637
+ − 1049
2140
+ − 1050
As said above, for deep binders we allow binding clauses such as
+ − 1051
%
1620
+ − 1052
\begin{center}
+ − 1053
\begin{tabular}{ll}
2140
+ − 1054
@{text "Bar p::pat t::trm"} &
1954
+ − 1055
\isacommand{bind} @{text "bn(p)"} \isacommand{in} @{text "p t"}\\
1620
+ − 1056
\end{tabular}
+ − 1057
\end{center}
+ − 1058
+ − 1059
\noindent
2344
+ − 1060
where the argument of the deep binder also occurs in the body. We call such
2140
+ − 1061
binders \emph{recursive}. To see the purpose of such recursive binders,
+ − 1062
compare ``plain'' @{text "Let"}s and @{text "Let_rec"}s in the following
+ − 1063
specification:
2343
+ − 1064
%
1725
+ − 1065
\begin{equation}\label{letrecs}
+ − 1066
\mbox{%
1637
+ − 1067
\begin{tabular}{@ {}l@ {}}
1725
+ − 1068
\isacommand{nominal\_datatype}~@{text "trm ="}\\
1636
+ − 1069
\hspace{5mm}\phantom{$\mid$}\ldots\\
1725
+ − 1070
\hspace{5mm}$\mid$~@{text "Let as::assn t::trm"}
+ − 1071
\;\;\isacommand{bind} @{text "bn(as)"} \isacommand{in} @{text t}\\
1954
+ − 1072
\hspace{5mm}$\mid$~@{text "Let_rec as::assn t::trm"}
+ − 1073
\;\;\isacommand{bind} @{text "bn(as)"} \isacommand{in} @{text "as t"}\\
+ − 1074
\isacommand{and} @{text "ass"} =\\
1725
+ − 1075
\hspace{5mm}\phantom{$\mid$}~@{text "ANil"}\\
+ − 1076
\hspace{5mm}$\mid$~@{text "ACons name trm assn"}\\
1954
+ − 1077
\isacommand{binder} @{text "bn::assn \<Rightarrow> atom list"}\\
1725
+ − 1078
\isacommand{where}~@{text "bn(ANil) = []"}\\
+ − 1079
\hspace{5mm}$\mid$~@{text "bn(ACons a t as) = [atom a] @ bn(as)"}\\
+ − 1080
\end{tabular}}
+ − 1081
\end{equation}
1636
+ − 1082
+ − 1083
\noindent
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1084
The difference is that with @{text Let} we only want to bind the atoms @{text
1730
+ − 1085
"bn(as)"} in the term @{text t}, but with @{text "Let_rec"} we also want to bind the atoms
2346
+ − 1086
inside the assignment. This difference has consequences for the associated
2347
+ − 1087
notions of free-atoms and $\alpha$-equivalence.
2341
+ − 1088
2347
+ − 1089
To make sure that atoms bound by deep binders cannot be free at the
2346
+ − 1090
same time, we cannot have more than one binding function for a deep binder.
2344
+ − 1091
Consequently we exclude specifications such as
2140
+ − 1092
+ − 1093
\begin{center}
2341
+ − 1094
\begin{tabular}{@ {}l@ {\hspace{2mm}}l@ {}}
+ − 1095
@{text "Baz\<^isub>1 p::pat t::trm"} &
2140
+ − 1096
\isacommand{bind} @{text "bn\<^isub>1(p) bn\<^isub>2(p)"} \isacommand{in} @{text t}\\
2341
+ − 1097
@{text "Baz\<^isub>2 p::pat t\<^isub>1::trm t\<^isub>2::trm"} &
+ − 1098
\isacommand{bind} @{text "bn\<^isub>1(p)"} \isacommand{in} @{text "t\<^isub>1"},
+ − 1099
\isacommand{bind} @{text "bn\<^isub>2(p)"} \isacommand{in} @{text "t\<^isub>2"}\\
2140
+ − 1100
\end{tabular}
+ − 1101
\end{center}
+ − 1102
+ − 1103
\noindent
2344
+ − 1104
Otherwise it is possible that @{text "bn\<^isub>1"} and @{text "bn\<^isub>2"} pick
2348
+ − 1105
out different atoms to become bound, respectively be free, in @{text "p"}.
2359
+ − 1106
(Since the Ott-tool does not derive a reasoning infrastructure for
+ − 1107
$\alpha$-equated terms, it can permit such specifications.)
2343
+ − 1108
2344
+ − 1109
We also need to restrict the form of the binding functions in order
2345
+ − 1110
to ensure the @{text "bn"}-functions can be defined for $\alpha$-equated
2346
+ − 1111
terms. The main restriction is that we cannot return an atom in a binding function that is also
+ − 1112
bound in the corresponding term-constructor. That means in \eqref{letpat}
+ − 1113
that the term-constructors @{text PVar} and @{text PTup} may
1961
+ − 1114
not have a binding clause (all arguments are used to define @{text "bn"}).
+ − 1115
In contrast, in case of \eqref{letrecs} the term-constructor @{text ACons}
2341
+ − 1116
may have a binding clause involving the argument @{text t} (the only one that
2343
+ − 1117
is \emph{not} used in the definition of the binding function). This restriction
2359
+ − 1118
is sufficient for having the binding function over $\alpha$-equated terms.
2341
+ − 1119
+ − 1120
In the version of
1961
+ − 1121
Nominal Isabelle described here, we also adopted the restriction from the
+ − 1122
Ott-tool that binding functions can only return: the empty set or empty list
+ − 1123
(as in case @{text PNil}), a singleton set or singleton list containing an
+ − 1124
atom (case @{text PVar}), or unions of atom sets or appended atom lists
2341
+ − 1125
(case @{text PTup}). This restriction will simplify some automatic definitions and proofs
1961
+ − 1126
later on.
+ − 1127
2347
+ − 1128
In order to simplify our definitions of free atoms and $\alpha$-equivalence,
2343
+ − 1129
we shall assume specifications
2341
+ − 1130
of term-calculi are implicitly \emph{completed}. By this we mean that
1954
+ − 1131
for every argument of a term-constructor that is \emph{not}
2163
+ − 1132
already part of a binding clause given by the user, we add implicitly a special \emph{empty} binding
+ − 1133
clause, written \isacommand{bind}~@{term "{}"}~\isacommand{in}~@{text "labels"}. In case
1956
+ − 1134
of the lambda-calculus, the completion produces
1954
+ − 1135
+ − 1136
\begin{center}
+ − 1137
\begin{tabular}{@ {}l@ {\hspace{-1mm}}}
+ − 1138
\isacommand{nominal\_datatype} @{text lam} =\\
+ − 1139
\hspace{5mm}\phantom{$\mid$}~@{text "Var x::name"}
+ − 1140
\;\;\isacommand{bind}~@{term "{}"}~\isacommand{in}~@{text "x"}\\
+ − 1141
\hspace{5mm}$\mid$~@{text "App t\<^isub>1::lam t\<^isub>2::lam"}
2163
+ − 1142
\;\;\isacommand{bind}~@{term "{}"}~\isacommand{in}~@{text "t\<^isub>1 t\<^isub>2"}\\
1954
+ − 1143
\hspace{5mm}$\mid$~@{text "Lam x::name t::lam"}
+ − 1144
\;\;\isacommand{bind}~@{text x} \isacommand{in} @{text t}\\
+ − 1145
\end{tabular}
+ − 1146
\end{center}
+ − 1147
+ − 1148
\noindent
+ − 1149
The point of completion is that we can make definitions over the binding
1961
+ − 1150
clauses and be sure to have captured all arguments of a term constructor.
2342
+ − 1151
*}
1954
+ − 1152
2347
+ − 1153
section {* Alpha-Equivalence and Free Atoms\label{sec:alpha} *}
2342
+ − 1154
+ − 1155
text {*
1637
+ − 1156
Having dealt with all syntax matters, the problem now is how we can turn
+ − 1157
specifications into actual type definitions in Isabelle/HOL and then
1926
+ − 1158
establish a reasoning infrastructure for them. As
1956
+ − 1159
Pottier and Cheney pointed out \cite{Pottier06,Cheney05}, just
1954
+ − 1160
re-arranging the arguments of
1956
+ − 1161
term-constructors so that binders and their bodies are next to each other will
2347
+ − 1162
result in inadequate representations in cases like @{text "Let x\<^isub>1 = t\<^isub>1\<dots>x\<^isub>n = t\<^isub>n in s"}.
2343
+ − 1163
Therefore we will first
2346
+ − 1164
extract ``raw'' datatype definitions from the specification and then define
2343
+ − 1165
explicitly an $\alpha$-equivalence relation over them. We subsequently
+ − 1166
quotient the datatypes according to our $\alpha$-equivalence.
1637
+ − 1167
+ − 1168
2346
+ − 1169
The ``raw'' datatype definition can be obtained by stripping off the
1771
+ − 1170
binding clauses and the labels from the types. We also have to invent
1637
+ − 1171
new names for the types @{text "ty\<^sup>\<alpha>"} and term-constructors @{text "C\<^sup>\<alpha>"}
1756
+ − 1172
given by the user. In our implementation we just use the affix ``@{text "_raw"}''.
1771
+ − 1173
But for the purpose of this paper, we use the superscript @{text "_\<^sup>\<alpha>"} to indicate
2341
+ − 1174
that a notion is defined over $\alpha$-equivalence classes and leave it out
1724
+ − 1175
for the corresponding notion defined on the ``raw'' level. So for example
+ − 1176
we have
+ − 1177
1636
+ − 1178
\begin{center}
1723
+ − 1179
@{text "ty\<^sup>\<alpha> \<mapsto> ty"} \hspace{2mm}and\hspace{2mm} @{text "C\<^sup>\<alpha> \<mapsto> C"}
1636
+ − 1180
\end{center}
+ − 1181
+ − 1182
\noindent
1730
+ − 1183
where @{term ty} is the type used in the quotient construction for
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1184
@{text "ty\<^sup>\<alpha>"} and @{text "C"} is the term-constructor on the ``raw'' type @{text "ty"}.
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1185
1637
+ − 1186
The resulting datatype definition is legal in Isabelle/HOL provided the datatypes are
+ − 1187
non-empty and the types in the constructors only occur in positive
2348
+ − 1188
position (see \cite{Berghofer99} for an in-depth description of the datatype package
+ − 1189
in Isabelle/HOL). We subsequently define each of the user-specified binding
+ − 1190
functions @{term "bn"}$_{1..m}$ by recursion over the corresponding
1730
+ − 1191
raw datatype. We can also easily define permutation operations by
2345
+ − 1192
recursion so that for each term constructor @{text "C"} we have that
1766
+ − 1193
%
+ − 1194
\begin{equation}\label{ceqvt}
1961
+ − 1195
@{text "p \<bullet> (C z\<^isub>1 \<dots> z\<^isub>n) = C (p \<bullet> z\<^isub>1) \<dots> (p \<bullet> z\<^isub>n)"}
1766
+ − 1196
\end{equation}
2343
+ − 1197
2341
+ − 1198
The first non-trivial step we have to perform is the generation of
2348
+ − 1199
free-atom functions from the specification. For the
2347
+ − 1200
\emph{raw} types @{text "ty"}$_{1..n}$ we define the free-atom functions
2343
+ − 1201
%
+ − 1202
\begin{equation}\label{fvars}
2347
+ − 1203
@{text "fa_ty\<^isub>1, \<dots>, fa_ty\<^isub>n"}
2343
+ − 1204
\end{equation}
2341
+ − 1205
+ − 1206
\noindent
2346
+ − 1207
by mutual recursion.
2347
+ − 1208
We define these functions together with auxiliary free-atom functions for
2343
+ − 1209
the binding functions. Given raw binding functions @{text "bn"}$_{1..m}$
+ − 1210
we define
+ − 1211
%
2341
+ − 1212
\begin{center}
2347
+ − 1213
@{text "fa_bn\<^isub>1, \<dots>, fa_bn\<^isub>m"}
2341
+ − 1214
\end{center}
+ − 1215
+ − 1216
\noindent
+ − 1217
The reason for this setup is that in a deep binder not all atoms have to be
+ − 1218
bound, as we saw in the example with ``plain'' @{text Let}s. We need therefore a function
2348
+ − 1219
that calculates those free atoms in a deep binder.
2343
+ − 1220
2347
+ − 1221
While the idea behind these free-atom functions is clear (they just
2343
+ − 1222
collect all atoms that are not bound), because of our rather complicated
2345
+ − 1223
binding mechanisms their definitions are somewhat involved. Given
2346
+ − 1224
a term-constructor @{text "C"} of type @{text ty} and some associated
2344
+ − 1225
binding clauses @{text "bc\<^isub>1\<dots>bc\<^isub>k"}, the result of @{text
2347
+ − 1226
"fa_ty (C z\<^isub>1 \<dots> z\<^isub>n)"} will be the union @{text
2348
+ − 1227
"fa(bc\<^isub>1) \<union> \<dots> \<union> fa(bc\<^isub>k)"} where we will define below what @{text "fa"} for a binding
2347
+ − 1228
clause means. We only show the details for the mode \isacommand{bind\_set} (the other modes are similar).
2345
+ − 1229
Suppose the binding clause @{text bc\<^isub>i} is of the form
2343
+ − 1230
%
2348
+ − 1231
\begin{center}
2344
+ − 1232
\mbox{\isacommand{bind\_set} @{text "b\<^isub>1\<dots>b\<^isub>p"} \isacommand{in} @{text "d\<^isub>1\<dots>d\<^isub>q"}}
2348
+ − 1233
\end{center}
2341
+ − 1234
2343
+ − 1235
\noindent
2344
+ − 1236
in which the body-labels @{text "d"}$_{1..q}$ refer to types @{text ty}$_{1..q}$,
+ − 1237
and the binders @{text b}$_{1..p}$
2343
+ − 1238
either refer to labels of atom types (in case of shallow binders) or to binding
2348
+ − 1239
functions taking a single label as argument (in case of deep binders). Assuming
+ − 1240
@{text "D"} stands for the set of free atoms of the bodies, @{text B} for the
+ − 1241
set of binding atoms in the binders and @{text "B'"} for the set of free atoms in
2344
+ − 1242
non-recursive deep binders,
2348
+ − 1243
then the free atoms of the binding clause @{text bc\<^isub>i} are
2343
+ − 1244
%
2348
+ − 1245
\begin{equation}\label{fadef}
+ − 1246
\mbox{@{text "fa(bc\<^isub>i) \<equiv> (D - B) \<union> B'"}}.
+ − 1247
\end{equation}
2343
+ − 1248
+ − 1249
\noindent
2348
+ − 1250
The set @{text D} is formally defined as
2343
+ − 1251
%
+ − 1252
\begin{center}
2347
+ − 1253
@{text "D \<equiv> fa_ty\<^isub>1 d\<^isub>1 \<union> ... \<union> fa_ty\<^isub>q d\<^isub>q"}
2343
+ − 1254
\end{center}
+ − 1255
+ − 1256
\noindent
2348
+ − 1257
where in case @{text "d\<^isub>i"} refers to one of the raw types @{text "ty"}$_{1..n}$ from the
+ − 1258
specification, the function @{text "fa_ty\<^isub>i"} is the corresponding free-atom function
+ − 1259
we are defining by recursion
+ − 1260
(see \eqref{fvars}); otherwise we set @{text "fa_ty\<^isub>i d\<^isub>i = supp d\<^isub>i"}.
+ − 1261
+ − 1262
In order to formally define the set @{text B} we use the following auxiliary @{text "bn"}-functions
+ − 1263
for atom types to which shallow binders may refer
2344
+ − 1264
%
1954
+ − 1265
\begin{center}
+ − 1266
\begin{tabular}{r@ {\hspace{2mm}}c@ {\hspace{2mm}}l}
2345
+ − 1267
@{text "bn_atom a"} & @{text "\<equiv>"} & @{text "{atom a}"}\\
+ − 1268
@{text "bn_atom_set as"} & @{text "\<equiv>"} & @{text "atoms as"}\\
+ − 1269
@{text "bn_atom_list as"} & @{text "\<equiv>"} & @{text "atoms (set as)"}
1954
+ − 1270
\end{tabular}
+ − 1271
\end{center}
+ − 1272
+ − 1273
\noindent
2348
+ − 1274
Like the function @{text atom}, the function @{text "atoms"} coerces
+ − 1275
a set of atoms to a set of the generic atom type. It is defined as
2344
+ − 1276
@{text "atoms as \<equiv> {atom a | a \<in> as}"}.
2345
+ − 1277
The set @{text B} is then formally defined as
2344
+ − 1278
%
+ − 1279
\begin{center}
+ − 1280
@{text "B \<equiv> bn_ty\<^isub>1 b\<^isub>1 \<union> ... \<union> bn_ty\<^isub>p b\<^isub>p"}
+ − 1281
\end{center}
1954
+ − 1282
2344
+ − 1283
\noindent
2348
+ − 1284
where we use the auxiliary binding functions for shallow binders.
2344
+ − 1285
The set @{text "B'"} collects all free atoms in non-recursive deep
2347
+ − 1286
binders. Let us assume these binders in @{text "bc\<^isub>i"} are
1956
+ − 1287
%
2344
+ − 1288
\begin{center}
2348
+ − 1289
@{text "bn\<^isub>1 l\<^isub>1, \<dots>, bn\<^isub>r l\<^isub>r"}
2344
+ − 1290
\end{center}
+ − 1291
+ − 1292
\noindent
2349
+ − 1293
with @{text "l"}$_{1..r}$ $\subseteq$ @{text "b"}$_{1..p}$ and none of the
+ − 1294
@{text "l"}$_{1..r}$ being among the bodies @{text
2345
+ − 1295
"d"}$_{1..q}$. The set @{text "B'"} is defined as
2344
+ − 1296
%
+ − 1297
\begin{center}
2348
+ − 1298
@{text "B' \<equiv> fa_bn\<^isub>1 l\<^isub>1 \<union> ... \<union> fa_bn\<^isub>r l\<^isub>r"}
2344
+ − 1299
\end{center}
1628
+ − 1300
1636
+ − 1301
\noindent
2348
+ − 1302
This completes the definition of the free-atom functions @{text "fa_ty"}$_{1..n}$.
2344
+ − 1303
2348
+ − 1304
Note that for non-recursive deep binders, we have to add in \eqref{fadef}
+ − 1305
the set of atoms that are left unbound by the binding functions @{text
2349
+ − 1306
"bn"}$_{1..m}$. We used for the definition of
2348
+ − 1307
this set the functions @{text "fa_bn"}$_{1..m}$, which are also defined by mutual
+ − 1308
recursion. Assume the user specified a @{text bn}-clause of the form
1956
+ − 1309
%
2344
+ − 1310
\begin{center}
2347
+ − 1311
@{text "bn (C z\<^isub>1 \<dots> z\<^isub>s) = rhs"}
2344
+ − 1312
\end{center}
1628
+ − 1313
1954
+ − 1314
\noindent
2347
+ − 1315
where the @{text "z"}$_{1..s}$ are of types @{text "ty"}$_{1..s}$. For each of
2345
+ − 1316
the arguments we calculate the free atoms as follows:
2344
+ − 1317
%
+ − 1318
\begin{center}
+ − 1319
\begin{tabular}{c@ {\hspace{2mm}}p{7cm}}
2347
+ − 1320
$\bullet$ & @{term "fa_ty\<^isub>i z\<^isub>i"} provided @{text "z\<^isub>i"} does not occur in @{text "rhs"}
2348
+ − 1321
(that means nothing is bound in @{text "z\<^isub>i"} by the binding function),\\
2347
+ − 1322
$\bullet$ & @{term "fa_bn\<^isub>i z\<^isub>i"} provided @{text "z\<^isub>i"} occurs in @{text "rhs"}
2345
+ − 1323
with the recursive call @{text "bn\<^isub>i z\<^isub>i"}, and\\
2344
+ − 1324
$\bullet$ & @{term "{}"} provided @{text "z\<^isub>i"} occurs in @{text "rhs"},
2347
+ − 1325
but without a recursive call.
2344
+ − 1326
\end{tabular}
+ − 1327
\end{center}
1758
731d39fb26b7
Update fv_bn definition for bindings allowed in types for which bn is present.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 1328
2344
+ − 1329
\noindent
2348
+ − 1330
For defining @{text "fa_bn (C z\<^isub>1 \<dots> z\<^isub>n)"} we just union up all these sets.
2344
+ − 1331
2348
+ − 1332
To see how these definitions work in practice, let us reconsider the
+ − 1333
term-constructors @{text "Let"} and @{text "Let_rec"} shown in
+ − 1334
\eqref{letrecs} together with the term-constructors for assignments @{text
+ − 1335
"ANil"} and @{text "ACons"}. Since there is a binding function defined for
+ − 1336
assignments, we have three free-atom functions, namely @{text
+ − 1337
"fa\<^bsub>trm\<^esub>"}, @{text "fa\<^bsub>assn\<^esub>"} and @{text
+ − 1338
"fa\<^bsub>bn\<^esub>"} as follows:
1725
+ − 1339
%
+ − 1340
\begin{center}
+ − 1341
\begin{tabular}{@ {}l@ {\hspace{1mm}}c@ {\hspace{1mm}}l@ {}}
2347
+ − 1342
@{text "fa\<^bsub>trm\<^esub> (Let as t)"} & @{text "="} & @{text "(fa\<^bsub>trm\<^esub> t - set (bn as)) \<union> fa\<^bsub>bn\<^esub> as"}\\
+ − 1343
@{text "fa\<^bsub>trm\<^esub> (Let_rec as t)"} & @{text "="} & @{text "(fa\<^bsub>assn\<^esub> as \<union> fa\<^bsub>trm\<^esub> t) - set (bn as)"}\\[1mm]
1725
+ − 1344
2347
+ − 1345
@{text "fa\<^bsub>assn\<^esub> (ANil)"} & @{text "="} & @{term "{}"}\\
+ − 1346
@{text "fa\<^bsub>assn\<^esub> (ACons a t as)"} & @{text "="} & @{text "(supp a) \<union> (fa\<^bsub>trm\<^esub> t) \<union> (fa\<^bsub>assn\<^esub> as)"}\\[1mm]
1725
+ − 1347
2347
+ − 1348
@{text "fa\<^bsub>bn\<^esub> (ANil)"} & @{text "="} & @{term "{}"}\\
+ − 1349
@{text "fa\<^bsub>bn\<^esub> (ACons a t as)"} & @{text "="} & @{text "(fa\<^bsub>trm\<^esub> t) \<union> (fa\<^bsub>bn\<^esub> as)"}
1725
+ − 1350
\end{tabular}
+ − 1351
\end{center}
+ − 1352
+ − 1353
\noindent
2349
+ − 1354
Recall that @{text ANil} and @{text "ACons"} have no
2347
+ − 1355
binding clause in the specification. The corresponding free-atom
2348
+ − 1356
function @{text "fa\<^bsub>assn\<^esub>"} therefore returns all free atoms
2360
+ − 1357
occurring in an assignment (in case of @{text "ACons"}, they are given in
+ − 1358
terms of @{text supp}, @{text "fa\<^bsub>trm\<^esub>"} and @{text "fa\<^bsub>assn\<^esub>"}).
2348
+ − 1359
The binding only takes place in @{text Let} and
+ − 1360
@{text "Let_rec"}. In case of @{text "Let"}, the binding clause specifies
2345
+ − 1361
that all atoms given by @{text "set (bn as)"} have to be bound in @{text
+ − 1362
t}. Therefore we have to subtract @{text "set (bn as)"} from @{text
2347
+ − 1363
"fa\<^bsub>trm\<^esub> t"}. However, we also need to add all atoms that are
2348
+ − 1364
free in @{text "as"}. This is
+ − 1365
in contrast with @{text "Let_rec"} where we have a recursive
+ − 1366
binder to bind all occurrences of the atoms in @{text
2345
+ − 1367
"set (bn as)"} also inside @{text "as"}. Therefore we have to subtract
2348
+ − 1368
@{text "set (bn as)"} from both @{text "fa\<^bsub>trm\<^esub> t"} and @{text "fa\<^bsub>assn\<^esub> as"}.
+ − 1369
Like the function @{text "bn"}, the function @{text "fa\<^bsub>bn\<^esub>"} traverses the
2349
+ − 1370
list of assignments, but instead returns the free atoms, which means in this
2348
+ − 1371
example the free atoms in the argument @{text "t"}.
+ − 1372
2345
+ − 1373
An interesting point in this
2348
+ − 1374
example is that a ``naked'' assignment (@{text "ANil"} or @{text "ACons"}) does not bind any
+ − 1375
atoms, even if the binding function is specified over assignments.
+ − 1376
Only in the context of a @{text Let} or @{text "Let_rec"}, where the binding clauses are given, will
+ − 1377
some atoms actually become bound. This is a phenomenon that has also been pointed
2345
+ − 1378
out in \cite{ott-jfp}. For us this observation is crucial, because we would
2348
+ − 1379
not be able to lift the @{text "bn"}-functions to $\alpha$-equated terms if they act on
+ − 1380
atoms that are bound. In that case, these functions would \emph{not} respect
2345
+ − 1381
$\alpha$-equivalence.
+ − 1382
2348
+ − 1383
Next we define the $\alpha$-equivalence relations for the raw types @{text
+ − 1384
"ty"}$_{1..n}$ from the specification. We write them as
1733
+ − 1385
%
2345
+ − 1386
\begin{center}
+ − 1387
@{text "\<approx>ty\<^isub>1, \<dots>, \<approx>ty\<^isub>n"}.
+ − 1388
\end{center}
1725
+ − 1389
1764
+ − 1390
\noindent
2347
+ − 1391
Like with the free-atom functions, we also need to
2345
+ − 1392
define auxiliary $\alpha$-equivalence relations
+ − 1393
%
+ − 1394
\begin{center}
+ − 1395
@{text "\<approx>bn\<^isub>1, \<dots>, \<approx>bn\<^isub>m"}
+ − 1396
\end{center}
2344
+ − 1397
2345
+ − 1398
\noindent
+ − 1399
for the binding functions @{text "bn"}$_{1..m}$,
+ − 1400
To simplify our definitions we will use the following abbreviations for
2348
+ − 1401
\emph{compound equivalence relations} and \emph{compound free-atom functions} acting on tuples
1733
+ − 1402
%
+ − 1403
\begin{center}
1737
+ − 1404
\begin{tabular}{r@ {\hspace{2mm}}c@ {\hspace{2mm}}l}
2348
+ − 1405
@{text "(x\<^isub>1,.., x\<^isub>n) (R\<^isub>1,.., R\<^isub>n) (x\<PRIME>\<^isub>1,.., x\<PRIME>\<^isub>n)"} & @{text "\<equiv>"} & \\
+ − 1406
\multicolumn{3}{r}{@{text "x\<^isub>1 R\<^isub>1 x\<PRIME>\<^isub>1 \<and> .. \<and> x\<^isub>n R\<^isub>n x\<PRIME>\<^isub>n"}}\\
+ − 1407
@{text "(fa\<^isub>1,.., fa\<^isub>n) (x\<^isub>1,.., x\<^isub>n)"} & @{text "\<equiv>"} & @{text "fa\<^isub>1 x\<^isub>1 \<union> .. \<union> fa\<^isub>n x\<^isub>n"}\\
1733
+ − 1408
\end{tabular}
+ − 1409
\end{center}
+ − 1410
1727
fd2913415a73
started to polish alpha-equivalence section, but needs more work
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1411
2348
+ − 1412
The $\alpha$-equivalence relations are defined as inductive predicates
+ − 1413
having a single clause for each term-constructor. Assuming a
+ − 1414
term-constructor @{text C} is of type @{text ty} and has the binding clauses
+ − 1415
@{term "bc"}$_{1..k}$, then the $\alpha$-equivalence clause has the form
1737
+ − 1416
%
+ − 1417
\begin{center}
2345
+ − 1418
\mbox{\infer{@{text "C z\<^isub>1 \<dots> z\<^isub>n \<approx>ty C z\<PRIME>\<^isub>1 \<dots> z\<PRIME>\<^isub>n"}}
2348
+ − 1419
{@{text "prems(bc\<^isub>1) \<dots> prems(bc\<^isub>k)"}}}
+ − 1420
\end{center}
+ − 1421
+ − 1422
\noindent
+ − 1423
The task below is to specify what the premises of a binding clause are. As a
+ − 1424
special instance, we first treat the case where @{text "bc\<^isub>i"} is the
+ − 1425
empty binding clause of the form
+ − 1426
%
+ − 1427
\begin{center}
+ − 1428
\mbox{\isacommand{bind\_set} @{term "{}"} \isacommand{in} @{text "d\<^isub>1\<dots>d\<^isub>q"}.}
+ − 1429
\end{center}
+ − 1430
+ − 1431
\noindent
+ − 1432
In this binding clause no atom is bound and we only have to $\alpha$-relate the bodies. For this
+ − 1433
we build first the tuples @{text "D \<equiv> (d\<^isub>1,\<dots>, d\<^isub>q)"} and @{text "D' \<equiv> (d\<PRIME>\<^isub>1,\<dots>, d\<PRIME>\<^isub>q)"}
+ − 1434
whereby the labels @{text "d"}$_{1..q}$ refer to arguments @{text "z"}$_{1..n}$ and
+ − 1435
respectively @{text "d\<PRIME>"}$_{1..q}$ to @{text "z\<PRIME>"}$_{1..n}$. In order to relate
+ − 1436
two such tuples we define the compound $\alpha$-equivalence relation @{text "R"} as follows
+ − 1437
%
+ − 1438
\begin{equation}\label{rempty}
+ − 1439
\mbox{@{text "R \<equiv> (R\<^isub>1,\<dots>, R\<^isub>q)"}}
+ − 1440
\end{equation}
+ − 1441
+ − 1442
\noindent
+ − 1443
with @{text "R\<^isub>i"} being @{text "\<approx>ty\<^isub>i"} if the corresponding labels @{text "d\<^isub>i"} and
+ − 1444
@{text "d\<PRIME>\<^isub>i"} refer
+ − 1445
to a recursive argument of @{text C} with type @{text "ty\<^isub>i"}; otherwise
+ − 1446
we take @{text "R\<^isub>i"} to be the equality @{text "="}. This lets us define
+ − 1447
the premise for an empty binding clause succinctly as @{text "prems(bc\<^isub>i) \<equiv> D R D'"},
+ − 1448
which can be unfolded to the series of premises
+ − 1449
%
+ − 1450
\begin{center}
+ − 1451
@{text "d\<^isub>1 R\<^isub>1 d\<PRIME>\<^isub>1 \<dots> d\<^isub>q R\<^isub>q d\<PRIME>\<^isub>q"}
+ − 1452
\end{center}
+ − 1453
+ − 1454
\noindent
+ − 1455
We will use the unfolded version in the examples below.
+ − 1456
+ − 1457
Now suppose the binding clause @{text "bc\<^isub>i"} is of the general form
+ − 1458
%
+ − 1459
\begin{equation}\label{nonempty}
+ − 1460
\mbox{\isacommand{bind\_set} @{text "b\<^isub>1\<dots>b\<^isub>p"} \isacommand{in} @{text "d\<^isub>1\<dots>d\<^isub>q"}.}
+ − 1461
\end{equation}
+ − 1462
+ − 1463
\noindent
+ − 1464
In this case we define a premise @{text P} using the relation
+ − 1465
$\approx_{\,\textit{set}}$ given in Section~\ref{sec:binders} (similarly
+ − 1466
$\approx_{\,\textit{res}}$ and $\approx_{\,\textit{list}}$ for the other
+ − 1467
binding modes). This premise defines $\alpha$-equivalence of two abstractions
2349
+ − 1468
involving multiple binders. As above, we first build the tuples @{text "D"} and
2348
+ − 1469
@{text "D'"} for the bodies @{text "d"}$_{1..q}$, and the corresponding
+ − 1470
compound $\alpha$-relation @{text "R"} (shown in \eqref{rempty}).
2359
+ − 1471
For $\approx_{\,\textit{set}}$ (respectively $\approx_{\,\textit{list}}$ and
+ − 1472
$\approx_{\,\textit{res}}$) we also need
2348
+ − 1473
a compound free-atom function for the bodies defined as
+ − 1474
%
+ − 1475
\begin{center}
+ − 1476
\mbox{@{text "fa \<equiv> (fa_ty\<^isub>1,\<dots>, fa_ty\<^isub>q)"}}
+ − 1477
\end{center}
+ − 1478
+ − 1479
\noindent
+ − 1480
with assumption that the @{text "d"}$_{1..q}$ refer to arguments of types @{text "ty"}$_{1..q}$.
+ − 1481
The last ingredient we need are the sets of atoms bound in the bodies.
+ − 1482
For this we take
+ − 1483
+ − 1484
\begin{center}
+ − 1485
@{text "B \<equiv> bn_ty\<^isub>1 b\<^isub>1 \<union> \<dots> \<union> bn_ty\<^isub>p b\<^isub>p"}\;.\\
1737
+ − 1486
\end{center}
+ − 1487
+ − 1488
\noindent
2348
+ − 1489
Similarly for @{text "B'"} using the labels @{text "b\<PRIME>"}$_{1..p}$. This
+ − 1490
lets us formally define the premise @{text P} for a non-empty binding clause as:
+ − 1491
%
2349
+ − 1492
\begin{center}
2348
+ − 1493
\mbox{@{term "P \<equiv> \<exists>p. (B, D) \<approx>gen R fa p (B', D')"}}\;.
2349
+ − 1494
\end{center}
2348
+ − 1495
+ − 1496
\noindent
+ − 1497
This premise accounts for $\alpha$-equivalence of the bodies of the binding
2359
+ − 1498
clause.
2349
+ − 1499
However, in case the binders have non-recursive deep binders, this premise
+ − 1500
is not enough:
2348
+ − 1501
we also have to ``propagate'' $\alpha$-equivalence inside the structure of
+ − 1502
these binders. An example is @{text "Let"} where we have to make sure the
2359
+ − 1503
right-hand sides of assignments are $\alpha$-equivalent. For this we use
2348
+ − 1504
relations @{text "\<approx>bn"}$_{1..m}$ (which we will formally define shortly).
+ − 1505
Let us assume the non-recursive deep binders in @{text "bc\<^isub>i"} are
+ − 1506
%
+ − 1507
\begin{center}
+ − 1508
@{text "bn\<^isub>1 l\<^isub>1, \<dots>, bn\<^isub>r l\<^isub>r"}.
+ − 1509
\end{center}
+ − 1510
+ − 1511
\noindent
2359
+ − 1512
The tuple @{text L} is then @{text "(l\<^isub>1,\<dots>,l\<^isub>r)"} (similarly @{text "L'"})
+ − 1513
and the compound equivalence relation @{text "R'"} is @{text "(\<approx>bn\<^isub>1,\<dots>,\<approx>bn\<^isub>r)"}.
2349
+ − 1514
All premises for @{text "bc\<^isub>i"} are then given by
2348
+ − 1515
%
+ − 1516
\begin{center}
2359
+ − 1517
@{text "prems(bc\<^isub>i) \<equiv> P \<and> L R' L'"}
2348
+ − 1518
\end{center}
+ − 1519
2349
+ − 1520
\noindent
2359
+ − 1521
The auxiliary $\alpha$-equivalence relations @{text "\<approx>bn"}$_{1..m}$
+ − 1522
in @{text "R'"} are defined as follows: assuming a @{text bn}-clause is of the form
2348
+ − 1523
%
+ − 1524
\begin{center}
+ − 1525
@{text "bn (C z\<^isub>1 \<dots> z\<^isub>s) = rhs"}
+ − 1526
\end{center}
+ − 1527
+ − 1528
\noindent
+ − 1529
where the @{text "z"}$_{1..s}$ are of types @{text "ty"}$_{1..s}$,
2359
+ − 1530
then the corresponding $\alpha$-equivalence clause for @{text "\<approx>bn"} has the form
2348
+ − 1531
%
+ − 1532
\begin{center}
+ − 1533
\mbox{\infer{@{text "C z\<^isub>1 \<dots> z\<^isub>s \<approx>bn C z\<PRIME>\<^isub>1 \<dots> z\<PRIME>\<^isub>s"}}
+ − 1534
{@{text "z\<^isub>1 R\<^isub>1 z\<PRIME>\<^isub>1 \<dots> z\<^isub>s R\<^isub>s z\<PRIME>\<^isub>s"}}}
+ − 1535
\end{center}
+ − 1536
+ − 1537
\noindent
2349
+ − 1538
In this clause the relations @{text "R"}$_{1..s}$ are given by
2348
+ − 1539
+ − 1540
\begin{center}
+ − 1541
\begin{tabular}{c@ {\hspace{2mm}}p{7cm}}
+ − 1542
$\bullet$ & @{text "z\<^isub>i \<approx>ty z\<PRIME>\<^isub>i"} provided @{text "z\<^isub>i"} does not occur in @{text rhs} and
+ − 1543
is a recursive argument of @{text C},\\
+ − 1544
$\bullet$ & @{text "z\<^isub>i = z\<PRIME>\<^isub>i"} provided @{text "z\<^isub>i"} does not occur in @{text rhs}
+ − 1545
and is a non-recursive argument of @{text C},\\
+ − 1546
$\bullet$ & @{text "z\<^isub>i \<approx>bn\<^isub>i z\<PRIME>\<^isub>i"} provided @{text "z\<^isub>i"} occurs in @{text rhs}
+ − 1547
with the recursive call @{text "bn\<^isub>i x\<^isub>i"} and\\
+ − 1548
$\bullet$ & @{text True} provided @{text "z\<^isub>i"} occurs in @{text rhs} but without a
+ − 1549
recursive call.
+ − 1550
\end{tabular}
+ − 1551
\end{center}
+ − 1552
+ − 1553
\noindent
+ − 1554
This completes the definition of $\alpha$-equivalence. As a sanity check, we can show
+ − 1555
that the premises of empty binding clauses are a special case of the clauses for
+ − 1556
non-empty ones (we just have to unfold the definition of $\approx_{\,\textit{set}}$ and take @{text "0"}
2349
+ − 1557
for the existentially quantified permutation).
2359
+ − 1558
+ − 1559
Again let us take a look at a concrete example for these definitions. For \eqref{letrecs}
2348
+ − 1560
we have three relations $\approx_{\textit{trm}}$, $\approx_{\textit{assn}}$ and
+ − 1561
$\approx_{\textit{bn}}$ with the following clauses:
1739
+ − 1562
+ − 1563
\begin{center}
+ − 1564
\begin{tabular}{@ {}c @ {}}
2350
+ − 1565
\infer{@{text "Let as t \<approx>\<^bsub>trm\<^esub> Let as' t'"}}
+ − 1566
{@{term "\<exists>p. (bn as, t) \<approx>lst alpha_trm fa_trm p (bn as', t')"} & @{text "as \<approx>\<^bsub>bn\<^esub> as'"}}\smallskip\\
2359
+ − 1567
\makebox[0mm]{\infer{@{text "Let_rec as t \<approx>\<^bsub>trm\<^esub> Let_rec as' t'"}}
+ − 1568
{@{term "\<exists>p. (bn as, ast) \<approx>lst alpha_trm2 fa_trm2 p (bn as', ast')"}}}
1739
+ − 1569
\end{tabular}
+ − 1570
\end{center}
+ − 1571
+ − 1572
\begin{center}
+ − 1573
\begin{tabular}{@ {}c @ {}}
2359
+ − 1574
\infer{@{text "ANil \<approx>\<^bsub>assn\<^esub> ANil"}}{}\smallskip\\
1739
+ − 1575
\infer{@{text "ACons a t as \<approx>\<^bsub>assn\<^esub> ACons a' t' as"}}
1771
+ − 1576
{@{text "a = a'"} & @{text "t \<approx>\<^bsub>trm\<^esub> t'"} & @{text "as \<approx>\<^bsub>assn\<^esub> as'"}}
1739
+ − 1577
\end{tabular}
+ − 1578
\end{center}
+ − 1579
+ − 1580
\begin{center}
+ − 1581
\begin{tabular}{@ {}c @ {}}
2359
+ − 1582
\infer{@{text "ANil \<approx>\<^bsub>bn\<^esub> ANil"}}{}\smallskip\\
1739
+ − 1583
\infer{@{text "ACons a t as \<approx>\<^bsub>bn\<^esub> ACons a' t' as"}}
1771
+ − 1584
{@{text "t \<approx>\<^bsub>trm\<^esub> t'"} & @{text "as \<approx>\<^bsub>bn\<^esub> as'"}}
1739
+ − 1585
\end{tabular}
+ − 1586
\end{center}
+ − 1587
+ − 1588
\noindent
+ − 1589
Note the difference between $\approx_{\textit{assn}}$ and
2341
+ − 1590
$\approx_{\textit{bn}}$: the latter only ``tracks'' $\alpha$-equivalence of
2359
+ − 1591
the components in an assignment that are \emph{not} bound. This is needed in the
+ − 1592
in the clause for @{text "Let"} (which is has
1771
+ − 1593
a non-recursive binder). The underlying reason is that the terms inside an assignment are not meant
1765
+ − 1594
to be ``under'' the binder. Such a premise is \emph{not} needed in @{text "Let_rec"},
2360
+ − 1595
because there all components of an assignment are ``under'' the binder.
1587
+ − 1596
*}
+ − 1597
1739
+ − 1598
section {* Establishing the Reasoning Infrastructure *}
1717
+ − 1599
+ − 1600
text {*
1766
+ − 1601
Having made all necessary definitions for raw terms, we can start
2361
+ − 1602
with establishing the reasoning infrastructure for the $\alpha$-equated types
+ − 1603
@{text "ty\<AL>"}$_{1..n}$, that is the types the user originally specified. We sketch
+ − 1604
in this section the proofs we need for establishing this infrastructure. One
+ − 1605
main point of our work is that we have completely automated these proofs in Isabelle/HOL.
+ − 1606
+ − 1607
First we establish that the
2359
+ − 1608
$\alpha$-equivalence relations defined in the previous section are
1766
+ − 1609
equivalence relations.
1717
+ − 1610
1766
+ − 1611
\begin{lemma}\label{equiv}
2361
+ − 1612
Given the raw types @{text "ty"}$_{1..n}$ and binding functions
+ − 1613
@{text "bn"}$_{1..m}$, the relations @{text "\<approx>ty"}$_{1..n}$ and
+ − 1614
@{text "\<approx>bn"}$_{1..m}$ are equivalence relations and equivariant.
1717
+ − 1615
\end{lemma}
1739
+ − 1616
+ − 1617
\begin{proof}
1752
+ − 1618
The proof is by mutual induction over the definitions. The non-trivial
2176
+ − 1619
cases involve premises built up by $\approx_{\textit{set}}$,
1739
+ − 1620
$\approx_{\textit{res}}$ and $\approx_{\textit{list}}$. They
1752
+ − 1621
can be dealt with as in Lemma~\ref{alphaeq}.
1739
+ − 1622
\end{proof}
1718
+ − 1623
1739
+ − 1624
\noindent
+ − 1625
We can feed this lemma into our quotient package and obtain new types @{text
2359
+ − 1626
"ty"}$^\alpha_{1..n}$ representing $\alpha$-equated terms of types @{text "ty"}$_{1..n}$.
+ − 1627
We also obtain definitions for the term-constructors @{text
2361
+ − 1628
"C"}$^\alpha_{1..k}$ from the raw term-constructors @{text
+ − 1629
"C"}$_{1..k}$, and similar definitions for the free-atom functions @{text
+ − 1630
"fa_ty"}$^\alpha_{1..n}$ and @{text "fa_bn"}$^\alpha_{1..m}$ as well as the binding functions @{text
+ − 1631
"bn"}$^\alpha_{1..m}$. However, these definitions are not really useful to the
1775
+ − 1632
user, since they are given in terms of the isomorphisms we obtained by
1754
+ − 1633
creating new types in Isabelle/HOL (recall the picture shown in the
1739
+ − 1634
Introduction).
+ − 1635
2361
+ − 1636
The first useful property for the user is the fact that distinct
+ − 1637
term-constructors are not
+ − 1638
equal, that is
1760
+ − 1639
%
+ − 1640
\begin{equation}\label{distinctalpha}
2361
+ − 1641
\mbox{@{text "C"}$^\alpha$~@{text "x\<^isub>1 \<dots> x\<^isub>r"}~@{text "\<noteq>"}~%
+ − 1642
@{text "D"}$^\alpha$~@{text "y\<^isub>1 \<dots> y\<^isub>s"}}
1760
+ − 1643
\end{equation}
+ − 1644
+ − 1645
\noindent
2361
+ − 1646
whenever @{text "C"}$^\alpha$~@{text "\<noteq>"}~@{text "D"}$^\alpha$.
+ − 1647
In order to derive this fact, we use the definition of $\alpha$-equivalence
+ − 1648
and establish that
1765
+ − 1649
%
+ − 1650
\begin{equation}\label{distinctraw}
2361
+ − 1651
\mbox{@{text "C x\<^isub>1 \<dots> x\<^isub>r"}\;$\not\approx$@{text ty}\;@{text "D y\<^isub>1 \<dots> y\<^isub>s"}}
1765
+ − 1652
\end{equation}
1760
+ − 1653
+ − 1654
\noindent
2361
+ − 1655
holds for the corresponding raw term-constructors.
+ − 1656
In order to deduce \eqref{distinctalpha} from \eqref{distinctraw}, our quotient
+ − 1657
package needs to know that the raw term-constructors @{text "C"} and @{text "D"}
2341
+ − 1658
are \emph{respectful} w.r.t.~the $\alpha$-equivalence relations (see \cite{Homeier05}).
2361
+ − 1659
Assuming, for example, @{text "C"} is of type @{text "ty"} with argument types
+ − 1660
@{text "ty"}$_{1..r}$, respectfulness amounts to showing that
2359
+ − 1661
%
1765
+ − 1662
\begin{center}
2361
+ − 1663
@{text "C x\<^isub>1 \<dots> x\<^isub>r \<approx>ty C x\<PRIME>\<^isub>1 \<dots> x\<PRIME>\<^isub>r"}
1765
+ − 1664
\end{center}
+ − 1665
+ − 1666
\noindent
2361
+ − 1667
holds under the assumptions that we have \mbox{@{text
+ − 1668
"x\<^isub>i \<approx>ty\<^isub>i x\<PRIME>\<^isub>i"}} whenever @{text "x\<^isub>i"}
+ − 1669
and @{text "x\<PRIME>\<^isub>i"} are recursive arguments of @{text C} and
+ − 1670
@{text "x\<^isub>i = x\<PRIME>\<^isub>i"} whenever they are non-recursive arguments. We can prove this
+ − 1671
implication by applying the corresponding rule in our $\alpha$-equivalence
+ − 1672
definition and by establishing the following auxiliary facts
1766
+ − 1673
%
+ − 1674
\begin{equation}\label{fnresp}
+ − 1675
\mbox{%
+ − 1676
\begin{tabular}{l}
2361
+ − 1677
@{text "x \<approx>ty\<^isub>i x\<PRIME>"}~~implies~@{text "fa_ty\<^isub>i x = fa_ty\<^isub>i x\<PRIME>"}\\
+ − 1678
@{text "x \<approx>ty\<^isub>j x\<PRIME>"}~~implies~@{text "fa_bn\<^isub>j x = fa_bn\<^isub>j x\<PRIME>"}\\
+ − 1679
@{text "x \<approx>ty\<^isub>j x\<PRIME>"}~~implies~@{text "bn\<^isub>j x = bn\<^isub>j x\<PRIME>"}\\
+ − 1680
@{text "x \<approx>ty\<^isub>j x\<PRIME>"}~~implies~@{text "x \<approx>bn\<^isub>j x\<PRIME>"}\\
1766
+ − 1681
\end{tabular}}
+ − 1682
\end{equation}
1717
+ − 1683
1766
+ − 1684
\noindent
2361
+ − 1685
They can be established by induction on @{text "\<approx>ty"}$_{1..n}$. Whereas the first,
+ − 1686
second and last implication are true by how we stated our definitions, the
+ − 1687
third \emph{only} holds because of our restriction
+ − 1688
imposed on the form of the binding functions---namely \emph{not} returning
+ − 1689
any bound atoms. In Ott, in contrast, the user may
+ − 1690
define @{text "bn"}$_{1..m}$ so that they return bound
+ − 1691
atoms and in this case the third implication is \emph{not} true. A
2363
+ − 1692
result is that the lifing of the corresponding binding functions in Ott to $\alpha$-equated
2361
+ − 1693
terms is impossible.
1766
+ − 1694
2361
+ − 1695
Having established respectfulness for the raw term-constructors, the
+ − 1696
quotient package is able to automatically deduce \eqref{distinctalpha} from
+ − 1697
\eqref{distinctraw}. Having the facts \eqref{fnresp} at our disposal, we can
+ − 1698
also lift properties that characterise when two raw terms of the form
+ − 1699
%
1718
+ − 1700
\begin{center}
2361
+ − 1701
@{text "C x\<^isub>1 \<dots> x\<^isub>r \<approx>ty C x\<PRIME>\<^isub>1 \<dots> x\<PRIME>\<^isub>r"}
1766
+ − 1702
\end{center}
+ − 1703
+ − 1704
\noindent
2341
+ − 1705
are $\alpha$-equivalent. This gives us conditions when the corresponding
+ − 1706
$\alpha$-equated terms are \emph{equal}, namely
2361
+ − 1707
%
1766
+ − 1708
\begin{center}
2361
+ − 1709
@{text "C\<^sup>\<alpha> x\<^isub>1 \<dots> x\<^isub>r = C\<^sup>\<alpha> x\<PRIME>\<^isub>1 \<dots> x\<PRIME>\<^isub>r"}
1766
+ − 1710
\end{center}
+ − 1711
+ − 1712
\noindent
2361
+ − 1713
We call these conditions as \emph{quasi-injectivity}. They correspond to
+ − 1714
the premises in our $\alpha$-equivalence relations.
+ − 1715
+ − 1716
Next we can lift the permutation
+ − 1717
operations defined in \eqref{ceqvt}. In order to make this
+ − 1718
lifting to go through, we have to show that the permutation operations are respectful.
+ − 1719
This amounts to showing that the
+ − 1720
$\alpha$-equivalence relations are equivariant, which we already established
+ − 1721
in Lemma~\ref{equiv}. As a result we can add the equations
+ − 1722
%
+ − 1723
\begin{equation}\label{calphaeqvt}
+ − 1724
@{text "p \<bullet> (C\<^sup>\<alpha> x\<^isub>1 \<dots> x\<^isub>r) = C\<^sup>\<alpha> (p \<bullet> x\<^isub>1) \<dots> (p \<bullet> x\<^isub>r)"}
+ − 1725
\end{equation}
+ − 1726
+ − 1727
\noindent
+ − 1728
to our infrastructure. In a similar fashion we can lift the defining equations
+ − 1729
of the free-atom functions @{text "fn_ty\<AL>"}$_{1..n}$ and
+ − 1730
@{text "fa_bn\<AL>"}$_{1..m}$ as well as of the binding functions @{text
2363
+ − 1731
"bn\<AL>"}$_{1..m}$ and the size functions @{text "size_ty\<AL>"}$_{1..n}$.
2361
+ − 1732
The latter are defined automatically for the raw types @{text "ty"}$_{1..n}$
+ − 1733
by the datatype package of Isabelle/HOL.
1766
+ − 1734
2361
+ − 1735
Finally we can add to our infrastructure a structural induction principle
+ − 1736
for the types @{text "ty\<AL>"}$_{i..n}$ whose
+ − 1737
conclusion of the form
+ − 1738
%
+ − 1739
\begin{equation}\label{weakinduct}
+ − 1740
\mbox{@{text "P\<^isub>1 x\<^isub>1 \<and> \<dots> \<and> P\<^isub>n x\<^isub>n "}}
+ − 1741
\end{equation}
1766
+ − 1742
2361
+ − 1743
\noindent
+ − 1744
whereby the @{text P}$_{1..n}$ are predicates and the @{text x}$_{1..n}$
+ − 1745
have types @{text "ty\<AL>"}$_{1..n}$. This induction principle has for each
+ − 1746
term constructor @{text "C"}$^\alpha$ a premise of the form
+ − 1747
%
+ − 1748
\begin{equation}\label{weakprem}
+ − 1749
\mbox{@{text "\<forall>x\<^isub>1\<dots>x\<^isub>r. P\<^isub>i x\<^isub>i \<and> \<dots> \<and> P\<^isub>j x\<^isub>j \<Rightarrow> P (C\<^sup>\<alpha> x\<^isub>1 \<dots> x\<^isub>r)"}}
+ − 1750
\end{equation}
+ − 1751
+ − 1752
\noindent
+ − 1753
in which the @{text "x"}$_{i..j}$ @{text "\<subseteq>"} @{text "x"}$_{1..r}$ are
+ − 1754
the recursive arguments of @{text "C\<AL>"}.
+ − 1755
+ − 1756
By working now completely on the $\alpha$-equated level, we
+ − 1757
can first show that the free-atom functions and binding functions are
+ − 1758
equivariant, namely
+ − 1759
%
1766
+ − 1760
\begin{center}
+ − 1761
\begin{tabular}{rcl}
2361
+ − 1762
@{text "p \<bullet> (fa_ty\<AL>\<^isub>i x)"} & $=$ & @{text "fa_ty\<AL>\<^isub>i (p \<bullet> x)"}\\
+ − 1763
@{text "p \<bullet> (fa_bn\<AL>\<^isub>j x)"} & $=$ & @{text "fa_bn\<AL>\<^isub>j (p \<bullet> x)"}\\
+ − 1764
@{text "p \<bullet> (bn\<AL>\<^isub>j x)"} & $=$ & @{text "bn\<AL>\<^isub>j (p \<bullet> x)"}
1718
+ − 1765
\end{tabular}
+ − 1766
\end{center}
1717
+ − 1767
1766
+ − 1768
\noindent
2361
+ − 1769
These properties can be established using the induction principle
+ − 1770
in \eqref{weakinduct}.
+ − 1771
Having these equivariant properties established, we can
1766
+ − 1772
show for every term-constructor @{text "C\<^sup>\<alpha>"} that
+ − 1773
+ − 1774
\begin{center}
2363
+ − 1775
@{text "(supp x\<^isub>1 \<union> \<dots> \<union> supp x\<^isub>r) supports (C\<^sup>\<alpha> x\<^isub>1 \<dots> x\<^isub>r)"}
1766
+ − 1776
\end{center}
+ − 1777
+ − 1778
\noindent
2363
+ − 1779
holds. This together with Property~\ref{supportsprop} allows us to prove
+ − 1780
that every @{text x} of type @{text "ty\<AL>"}$_{1..n}$ is finitely supported,
2361
+ − 1781
namely @{text "finite (supp x)"}. This can be again shown by induction
+ − 1782
over @{text "ty\<AL>"}$_{1..n}$. Lastly, we can show that the support of
+ − 1783
elements in @{text "ty\<AL>"}$_{1..n}$ is the same as @{text "fa_ty\<AL>"}$_{1..n}$.
2363
+ − 1784
This fact is important in a nominal setting, but also provides evidence
+ − 1785
that our notions of free-atoms and $\alpha$-equivalence are correct.
1766
+ − 1786
1767
+ − 1787
\begin{lemma}
2361
+ − 1788
For every @{text "x"} of type @{text "ty\<AL>"}$_{1..n}$, we have
+ − 1789
@{text "supp x = fa_ty\<AL>\<^isub>i x"}.
1722
+ − 1790
\end{lemma}
1766
+ − 1791
1722
+ − 1792
\begin{proof}
2361
+ − 1793
The proof is by induction. In each case
1766
+ − 1794
we unfold the definition of @{text "supp"}, move the swapping inside the
2361
+ − 1795
term-constructors and then use the quasi-injectivity lemmas in order to complete the
1770
+ − 1796
proof. For the abstraction cases we use the facts derived in Theorem~\ref{suppabs}.
1722
+ − 1797
\end{proof}
1721
+ − 1798
1766
+ − 1799
\noindent
2363
+ − 1800
To sum up this section, we can established automatically a reasoning infrastructure
2361
+ − 1801
for the types @{text "ty\<AL>"}$_{1..n}$
1766
+ − 1802
by first lifting definitions from the raw level to the quotient level and
2361
+ − 1803
then by establishing facts about these lifted definitions. All necessary proofs
1770
+ − 1804
are generated automatically by custom ML-code. This code can deal with
2363
+ − 1805
specifications such as the one shown in Figure~\ref{nominalcorehas} for Core-Haskell.
1728
+ − 1806
1766
+ − 1807
\begin{figure}[t!]
+ − 1808
\begin{boxedminipage}{\linewidth}
+ − 1809
\small
+ − 1810
\begin{tabular}{l}
2361
+ − 1811
\isacommand{atom\_decl}~@{text "var cvar tvar"}\\[1mm]
1766
+ − 1812
\isacommand{nominal\_datatype}~@{text "tkind ="}\\
+ − 1813
\phantom{$|$}~@{text "KStar"}~$|$~@{text "KFun tkind tkind"}\\
+ − 1814
\isacommand{and}~@{text "ckind ="}\\
+ − 1815
\phantom{$|$}~@{text "CKSim ty ty"}\\
+ − 1816
\isacommand{and}~@{text "ty ="}\\
+ − 1817
\phantom{$|$}~@{text "TVar tvar"}~$|$~@{text "T string"}~$|$~@{text "TApp ty ty"}\\
+ − 1818
$|$~@{text "TFun string ty_list"}~%
+ − 1819
$|$~@{text "TAll tv::tvar tkind ty::ty"} \isacommand{bind}~@{text "tv"}~\isacommand{in}~@{text ty}\\
+ − 1820
$|$~@{text "TArr ckind ty"}\\
+ − 1821
\isacommand{and}~@{text "ty_lst ="}\\
+ − 1822
\phantom{$|$}~@{text "TNil"}~$|$~@{text "TCons ty ty_lst"}\\
+ − 1823
\isacommand{and}~@{text "cty ="}\\
+ − 1824
\phantom{$|$}~@{text "CVar cvar"}~%
+ − 1825
$|$~@{text "C string"}~$|$~@{text "CApp cty cty"}~$|$~@{text "CFun string co_lst"}\\
+ − 1826
$|$~@{text "CAll cv::cvar ckind cty::cty"} \isacommand{bind}~@{text "cv"}~\isacommand{in}~@{text cty}\\
+ − 1827
$|$~@{text "CArr ckind cty"}~$|$~@{text "CRefl ty"}~$|$~@{text "CSym cty"}~$|$~@{text "CCirc cty cty"}\\
+ − 1828
$|$~@{text "CAt cty ty"}~$|$~@{text "CLeft cty"}~$|$~@{text "CRight cty"}~$|$~@{text "CSim cty cty"}\\
+ − 1829
$|$~@{text "CRightc cty"}~$|$~@{text "CLeftc cty"}~$|$~@{text "Coerce cty cty"}\\
+ − 1830
\isacommand{and}~@{text "co_lst ="}\\
+ − 1831
\phantom{$|$}@{text "CNil"}~$|$~@{text "CCons cty co_lst"}\\
+ − 1832
\isacommand{and}~@{text "trm ="}\\
+ − 1833
\phantom{$|$}~@{text "Var var"}~$|$~@{text "K string"}\\
+ − 1834
$|$~@{text "LAM_ty tv::tvar tkind t::trm"} \isacommand{bind}~@{text "tv"}~\isacommand{in}~@{text t}\\
+ − 1835
$|$~@{text "LAM_cty cv::cvar ckind t::trm"} \isacommand{bind}~@{text "cv"}~\isacommand{in}~@{text t}\\
+ − 1836
$|$~@{text "App_ty trm ty"}~$|$~@{text "App_cty trm cty"}~$|$~@{text "App trm trm"}\\
+ − 1837
$|$~@{text "Lam v::var ty t::trm"} \isacommand{bind}~@{text "v"}~\isacommand{in}~@{text t}\\
+ − 1838
$|$~@{text "Let x::var ty trm t::trm"} \isacommand{bind}~@{text x}~\isacommand{in}~@{text t}\\
+ − 1839
$|$~@{text "Case trm assoc_lst"}~$|$~@{text "Cast trm co"}\\
+ − 1840
\isacommand{and}~@{text "assoc_lst ="}\\
+ − 1841
\phantom{$|$}~@{text ANil}~%
+ − 1842
$|$~@{text "ACons p::pat t::trm assoc_lst"} \isacommand{bind}~@{text "bv p"}~\isacommand{in}~@{text t}\\
+ − 1843
\isacommand{and}~@{text "pat ="}\\
+ − 1844
\phantom{$|$}~@{text "Kpat string tvtk_lst tvck_lst vt_lst"}\\
+ − 1845
\isacommand{and}~@{text "vt_lst ="}\\
+ − 1846
\phantom{$|$}~@{text VTNil}~$|$~@{text "VTCons var ty vt_lst"}\\
+ − 1847
\isacommand{and}~@{text "tvtk_lst ="}\\
+ − 1848
\phantom{$|$}~@{text TVTKNil}~$|$~@{text "TVTKCons tvar tkind tvtk_lst"}\\
+ − 1849
\isacommand{and}~@{text "tvck_lst ="}\\
+ − 1850
\phantom{$|$}~@{text TVCKNil}~$|$ @{text "TVCKCons cvar ckind tvck_lst"}\\
+ − 1851
\isacommand{binder}\\
+ − 1852
@{text "bv :: pat \<Rightarrow> atom list"}~\isacommand{and}~%
+ − 1853
@{text "bv1 :: vt_lst \<Rightarrow> atom list"}~\isacommand{and}\\
+ − 1854
@{text "bv2 :: tvtk_lst \<Rightarrow> atom list"}~\isacommand{and}~%
+ − 1855
@{text "bv3 :: tvck_lst \<Rightarrow> atom list"}\\
+ − 1856
\isacommand{where}\\
+ − 1857
\phantom{$|$}~@{text "bv (K s tvts tvcs vs) = (bv3 tvts) @ (bv2 tvcs) @ (bv1 vs)"}\\
+ − 1858
$|$~@{text "bv1 VTNil = []"}\\
+ − 1859
$|$~@{text "bv1 (VTCons x ty tl) = (atom x)::(bv1 tl)"}\\
+ − 1860
$|$~@{text "bv2 TVTKNil = []"}\\
+ − 1861
$|$~@{text "bv2 (TVTKCons a ty tl) = (atom a)::(bv2 tl)"}\\
+ − 1862
$|$~@{text "bv3 TVCKNil = []"}\\
+ − 1863
$|$~@{text "bv3 (TVCKCons c cty tl) = (atom c)::(bv3 tl)"}\\
+ − 1864
\end{tabular}
+ − 1865
\end{boxedminipage}
1890
+ − 1866
\caption{The nominal datatype declaration for Core-Haskell. For the moment we
1766
+ − 1867
do not support nested types; therefore we explicitly have to unfold the
+ − 1868
lists @{text "co_lst"}, @{text "assoc_lst"} and so on. This will be improved
+ − 1869
in a future version of Nominal Isabelle. Apart from that, the
+ − 1870
declaration follows closely the original in Figure~\ref{corehas}. The
+ − 1871
point of our work is that having made such a declaration in Nominal Isabelle,
+ − 1872
one obtains automatically a reasoning infrastructure for Core-Haskell.
+ − 1873
\label{nominalcorehas}}
+ − 1874
\end{figure}
+ − 1875
*}
1728
+ − 1876
1587
+ − 1877
1747
+ − 1878
section {* Strong Induction Principles *}
+ − 1879
+ − 1880
text {*
1764
+ − 1881
In the previous section we were able to provide induction principles that
2341
+ − 1882
allow us to perform structural inductions over $\alpha$-equated terms.
2363
+ − 1883
We call such induction principles \emph{weak}, because in case of the
+ − 1884
term-constructor @{text "C\<^sup>\<alpha> x\<^isub>1 \<dots> x\<^isub>r"},
2361
+ − 1885
the induction hypothesis requires us to establish the implications \eqref{weakprem}.
2363
+ − 1886
The problem with these implications is that in general they are difficult to establish.
1771
+ − 1887
The reason is that we cannot make any assumption about the binders that might be in @{text "C\<^sup>\<alpha>"}
1770
+ − 1888
(for example we cannot assume the variable convention for them).
1764
+ − 1889
+ − 1890
In \cite{UrbanTasson05} we introduced a method for automatically
+ − 1891
strengthening weak induction principles for terms containing single
1768
+ − 1892
binders. These stronger induction principles allow the user to make additional
1771
+ − 1893
assumptions about binders.
1768
+ − 1894
These additional assumptions amount to a formal
+ − 1895
version of the informal variable convention for binders. A natural question is
+ − 1896
whether we can also strengthen the weak induction principles involving
1771
+ − 1897
the general binders presented here. We will indeed be able to so, but for this we need an
1770
+ − 1898
additional notion for permuting deep binders.
1764
+ − 1899
1768
+ − 1900
Given a binding function @{text "bn"} we define an auxiliary permutation
1764
+ − 1901
operation @{text "_ \<bullet>\<^bsub>bn\<^esub> _"} which permutes only bound arguments in a deep binder.
2363
+ − 1902
Assuming a clause of @{text bn} is given as
+ − 1903
%
+ − 1904
\begin{center}
+ − 1905
@{text "bn (C x\<^isub>1 \<dots> x\<^isub>r) = rhs"},
+ − 1906
\end{center}
+ − 1907
+ − 1908
\noindent
+ − 1909
then we define
+ − 1910
%
+ − 1911
\begin{center}
+ − 1912
@{text "p \<bullet>\<^bsub>bn\<^esub> (C x\<^isub>1 \<dots> x\<^isub>r) \<equiv> C y\<^isub>1 \<dots> y\<^isub>r"}
+ − 1913
\end{center}
+ − 1914
+ − 1915
\noindent
+ − 1916
with @{text "y\<^isub>i"} determined as follows:
1764
+ − 1917
%
+ − 1918
\begin{center}
+ − 1919
\begin{tabular}{c@ {\hspace{2mm}}p{7cm}}
+ − 1920
$\bullet$ & @{text "y\<^isub>i \<equiv> x\<^isub>i"} provided @{text "x\<^isub>i"} does not occur in @{text "rhs"}\\
+ − 1921
$\bullet$ & @{text "y\<^isub>i \<equiv> p \<bullet>\<^bsub>bn'\<^esub> x\<^isub>i"} provided @{text "bn' x\<^isub>i"} is in @{text "rhs"}\\
+ − 1922
$\bullet$ & @{text "y\<^isub>i \<equiv> p \<bullet> x\<^isub>i"} otherwise
+ − 1923
\end{tabular}
+ − 1924
\end{center}
+ − 1925
+ − 1926
\noindent
1771
+ − 1927
Using again the quotient package we can lift the @{text "_ \<bullet>\<^bsub>bn\<^esub> _"} function to
2341
+ − 1928
$\alpha$-equated terms. We can then prove the following two facts
1764
+ − 1929
1770
+ − 1930
\begin{lemma}\label{permutebn}
+ − 1931
Given a binding function @{text "bn\<^sup>\<alpha>"} then for all @{text p}
2363
+ − 1932
{\it (i)} @{text "p \<bullet> (bn\<^sup>\<alpha> x) = bn\<^sup>\<alpha> (p \<bullet>\<AL>\<^bsub>bn\<^esub> x)"} and {\it (ii)}
+ − 1933
@{text "fa_bn\<^isup>\<alpha> x = fa_bn\<^isup>\<alpha> (p \<bullet>\<AL>\<^bsub>bn\<^esub> x)"}.
1764
+ − 1934
\end{lemma}
+ − 1935
+ − 1936
\begin{proof}
1771
+ − 1937
By induction on @{text x}. The equations follow by simple unfolding
1764
+ − 1938
of the definitions.
+ − 1939
\end{proof}
+ − 1940
1769
+ − 1941
\noindent
1768
+ − 1942
The first property states that a permutation applied to a binding function is
+ − 1943
equivalent to first permuting the binders and then calculating the bound
2347
+ − 1944
atoms. The second amounts to the fact that permuting the binders has no
+ − 1945
effect on the free-atom function. The main point of this permutation
1769
+ − 1946
function, however, is that if we have a permutation that is fresh
+ − 1947
for the support of an object @{text x}, then we can use this permutation
1770
+ − 1948
to rename the binders in @{text x}, without ``changing'' @{text x}. In case of the
1769
+ − 1949
@{text "Let"} term-constructor from the example shown
2363
+ − 1950
in \eqref{letpat} this means for a permutation @{text "r"}
1770
+ − 1951
%
+ − 1952
\begin{equation}\label{renaming}
1771
+ − 1953
\begin{array}{l}
+ − 1954
\mbox{if @{term "supp (Abs_lst (bn p) t\<^isub>2) \<sharp>* r"}}\\
2363
+ − 1955
\qquad\mbox{then @{text "Let p t\<^isub>1 t\<^isub>2 = Let (r \<bullet>\<AL>\<^bsub>bn_pat\<^esub> p) t\<^isub>1 (r \<bullet> t\<^isub>2)"}}
1771
+ − 1956
\end{array}
1770
+ − 1957
\end{equation}
1769
+ − 1958
+ − 1959
\noindent
2363
+ − 1960
This fact will be crucial when establishing the strong induction principles below.
+ − 1961
+ − 1962
+ − 1963
In our running example about @{text "Let"}, the strong induction
+ − 1964
principle means that instead
1770
+ − 1965
of establishing the implication
2361
+ − 1966
%
1764
+ − 1967
\begin{center}
1771
+ − 1968
@{text "\<forall>p t\<^isub>1 t\<^isub>2. P\<^bsub>pat\<^esub> p \<and> P\<^bsub>trm\<^esub> t\<^isub>1 \<and> P\<^bsub>trm\<^esub> t\<^isub>2 \<Rightarrow> P\<^bsub>trm\<^esub> (Let p t\<^isub>1 t\<^isub>2)"}
1764
+ − 1969
\end{center}
+ − 1970
+ − 1971
\noindent
1769
+ − 1972
it is sufficient to establish the following implication
1770
+ − 1973
%
+ − 1974
\begin{equation}\label{strong}
+ − 1975
\mbox{\begin{tabular}{l}
1771
+ − 1976
@{text "\<forall>p t\<^isub>1 t\<^isub>2 c."}\\
+ − 1977
\hspace{5mm}@{text "set (bn p) #\<^sup>* c \<and>"}\\
+ − 1978
\hspace{5mm}@{text "(\<forall>d. P\<^bsub>pat\<^esub> d p) \<and> (\<forall>d. P\<^bsub>trm\<^esub> d t\<^isub>1) \<and> (\<forall>d. P\<^bsub>trm\<^esub> d t\<^isub>2)"}\\
+ − 1979
\hspace{15mm}@{text "\<Rightarrow> P\<^bsub>trm\<^esub> c (Let p t\<^isub>1 t\<^isub>2)"}
1770
+ − 1980
\end{tabular}}
+ − 1981
\end{equation}
+ − 1982
+ − 1983
\noindent
+ − 1984
While this implication contains an additional argument, namely @{text c}, and
+ − 1985
also additional universal quantifications, it is usually easier to establish.
2363
+ − 1986
The reason is that we have the freshness
1770
+ − 1987
assumption @{text "set (bn\<^sup>\<alpha> p) #\<^sup>* c"}, whereby @{text c} can be arbitrarily
+ − 1988
chosen by the user as long as it has finite support.
+ − 1989
+ − 1990
Let us now show how we derive the strong induction principles from the
+ − 1991
weak ones. In case of the @{text "Let"}-example we derive by the weak
+ − 1992
induction the following two properties
+ − 1993
%
+ − 1994
\begin{equation}\label{hyps}
+ − 1995
@{text "\<forall>q c. P\<^bsub>trm\<^esub> c (q \<bullet> t)"} \hspace{4mm}
2363
+ − 1996
@{text "\<forall>q\<^isub>1 q\<^isub>2 c. P\<^bsub>pat\<^esub> (q\<^isub>1 \<bullet>\<AL>\<^bsub>bn\<^esub> (q\<^isub>2 \<bullet> p))"}
1770
+ − 1997
\end{equation}
+ − 1998
+ − 1999
\noindent
1771
+ − 2000
For the @{text Let} term-constructor we therefore have to establish @{text "P\<^bsub>trm\<^esub> c (q \<bullet> Let p t\<^isub>1 t\<^isub>2)"}
+ − 2001
assuming \eqref{hyps} as induction hypotheses (the first for @{text t\<^isub>1} and @{text t\<^isub>2}).
+ − 2002
By Property~\ref{avoiding} we
1770
+ − 2003
obtain a permutation @{text "r"} such that
+ − 2004
%
+ − 2005
\begin{equation}\label{rprops}
+ − 2006
@{term "(r \<bullet> set (bn (q \<bullet> p))) \<sharp>* c "}\hspace{4mm}
1771
+ − 2007
@{term "supp (Abs_lst (bn (q \<bullet> p)) (q \<bullet> t\<^isub>2)) \<sharp>* r"}
1770
+ − 2008
\end{equation}
+ − 2009
+ − 2010
\noindent
+ − 2011
hold. The latter fact and \eqref{renaming} give us
2361
+ − 2012
%
1765
+ − 2013
\begin{center}
1771
+ − 2014
\begin{tabular}{l}
+ − 2015
@{text "Let (q \<bullet> p) (q \<bullet> t\<^isub>1) (q \<bullet> t\<^isub>2) ="} \\
2363
+ − 2016
\hspace{15mm}@{text "Let (r \<bullet>\<AL>\<^bsub>bn\<^esub> (q \<bullet> p)) (q \<bullet> t\<^isub>1) (r \<bullet> (q \<bullet> t\<^isub>2))"}
1771
+ − 2017
\end{tabular}
1770
+ − 2018
\end{center}
+ − 2019
+ − 2020
\noindent
2176
+ − 2021
So instead of proving @{text "P\<^bsub>trm\<^esub> c (q \<bullet> Let p t\<^isub>1 t\<^isub>2)"}, we can equally
2363
+ − 2022
establish @{text "P\<^bsub>trm\<^esub> c (Let (r \<bullet>\<AL>\<^bsub>bn\<^esub> (q \<bullet> p)) (q \<bullet> t\<^isub>1) (r \<bullet> (q \<bullet> t\<^isub>2)))"}.
1770
+ − 2023
To do so, we will use the implication \eqref{strong} of the strong induction
+ − 2024
principle, which requires us to discharge
1771
+ − 2025
the following four proof obligations:
2361
+ − 2026
%
1770
+ − 2027
\begin{center}
+ − 2028
\begin{tabular}{rl}
2363
+ − 2029
{\it (i)} & @{text "set (bn (r \<bullet>\<AL>\<^bsub>bn\<^esub> (q \<bullet> p))) #\<^sup>* c"}\\
+ − 2030
{\it (ii)} & @{text "\<forall>d. P\<^bsub>pat\<^esub> d (r \<bullet>\<AL>\<^bsub>bn\<^esub> (q \<bullet> p))"}\\
+ − 2031
{\it (iii)} & @{text "\<forall>d. P\<^bsub>trm\<^esub> d (q \<bullet> t\<^isub>1)"}\\
+ − 2032
{\it (iv)} & @{text "\<forall>d. P\<^bsub>trm\<^esub> d (r \<bullet> (q \<bullet> t\<^isub>2))"}\\
1765
+ − 2033
\end{tabular}
+ − 2034
\end{center}
1764
+ − 2035
1770
+ − 2036
\noindent
2363
+ − 2037
The first follows from \eqref{rprops} and Lemma~\ref{permutebn}.{\it (i)}; the
1771
+ − 2038
others from the induction hypotheses in \eqref{hyps} (in the fourth case
+ − 2039
we have to use the fact that @{term "(r \<bullet> (q \<bullet> t\<^isub>2)) = (r + q) \<bullet> t\<^isub>2"}).
1748
+ − 2040
1770
+ − 2041
Taking now the identity permutation @{text 0} for the permutations in \eqref{hyps},
+ − 2042
we can establish our original goals, namely @{text "P\<^bsub>trm\<^esub> c t"} and \mbox{@{text "P\<^bsub>pat\<^esub> c p"}}.
2363
+ − 2043
This completes the proof showing that the weak induction principles imply
+ − 2044
the strong induction principles.
1747
+ − 2045
*}
+ − 2046
1702
+ − 2047
1517
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 2048
section {* Related Work *}
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 2049
1570
+ − 2050
text {*
2342
+ − 2051
To our knowledge the earliest usage of general binders in a theorem prover
1760
+ − 2052
is described in \cite{NaraschewskiNipkow99} about a formalisation of the
2361
+ − 2053
algorithm W. This formalisation implements binding in type-schemes using a
+ − 2054
de-Bruijn indices representation. Since type-schemes in W contain only a single
2360
+ − 2055
place where variables are bound, different indices do not refer to different binders (as in the usual
1760
+ − 2056
de-Bruijn representation), but to different bound variables. A similar idea
+ − 2057
has been recently explored for general binders in the locally nameless
1764
+ − 2058
approach to binding \cite{chargueraud09}. There, de-Bruijn indices consist
1760
+ − 2059
of two numbers, one referring to the place where a variable is bound and the
+ − 2060
other to which variable is bound. The reasoning infrastructure for both
2163
+ − 2061
representations of bindings comes for free in theorem provers like Isabelle/HOL or
2342
+ − 2062
Coq, since the corresponding term-calculi can be implemented as ``normal''
1764
+ − 2063
datatypes. However, in both approaches it seems difficult to achieve our
+ − 2064
fine-grained control over the ``semantics'' of bindings (i.e.~whether the
+ − 2065
order of binders should matter, or vacuous binders should be taken into
+ − 2066
account). To do so, one would require additional predicates that filter out
2163
+ − 2067
unwanted terms. Our guess is that such predicates result in rather
1764
+ − 2068
intricate formal reasoning.
1740
+ − 2069
+ − 2070
Another representation technique for binding is higher-order abstract syntax
1764
+ − 2071
(HOAS), which for example is implemented in the Twelf system. This representation
1760
+ − 2072
technique supports very elegantly many aspects of \emph{single} binding, and
2342
+ − 2073
impressive work has been done that uses HOAS for mechanising the metatheory
1764
+ − 2074
of SML~\cite{LeeCraryHarper07}. We are, however, not aware how multiple
+ − 2075
binders of SML are represented in this work. Judging from the submitted
+ − 2076
Twelf-solution for the POPLmark challenge, HOAS cannot easily deal with
+ − 2077
binding constructs where the number of bound variables is not fixed. For
+ − 2078
example in the second part of this challenge, @{text "Let"}s involve
+ − 2079
patterns that bind multiple variables at once. In such situations, HOAS
+ − 2080
representations have to resort to the iterated-single-binders-approach with
+ − 2081
all the unwanted consequences when reasoning about the resulting terms.
1740
+ − 2082
2362
+ − 2083
Two formalisations involving general binders have been
2360
+ − 2084
performed in older
2342
+ − 2085
versions of Nominal Isabelle (one about Psi-calculi and one about algorithm W
2163
+ − 2086
\cite{BengtsonParow09, UrbanNipkow09}). Both
1764
+ − 2087
use the approach based on iterated single binders. Our experience with
+ − 2088
the latter formalisation has been disappointing. The major pain arose from
+ − 2089
the need to ``unbind'' variables. This can be done in one step with our
2363
+ − 2090
general binders described in this paper, but needs a cumbersome
1764
+ − 2091
iteration with single binders. The resulting formal reasoning turned out to
+ − 2092
be rather unpleasant. The hope is that the extension presented in this paper
+ − 2093
is a substantial improvement.
1726
+ − 2094
2163
+ − 2095
The most closely related work to the one presented here is the Ott-tool
+ − 2096
\cite{ott-jfp} and the C$\alpha$ml language \cite{Pottier06}. Ott is a nifty
+ − 2097
front-end for creating \LaTeX{} documents from specifications of
2343
+ − 2098
term-calculi involving general binders. For a subset of the specifications
2163
+ − 2099
Ott can also generate theorem prover code using a raw representation of
+ − 2100
terms, and in Coq also a locally nameless representation. The developers of
+ − 2101
this tool have also put forward (on paper) a definition for
2341
+ − 2102
$\alpha$-equivalence of terms that can be specified in Ott. This definition is
2163
+ − 2103
rather different from ours, not using any nominal techniques. To our
+ − 2104
knowledge there is also no concrete mathematical result concerning this
2341
+ − 2105
notion of $\alpha$-equivalence. A definition for the notion of free variables
2362
+ − 2106
is work in progress in Ott.
2163
+ − 2107
2362
+ − 2108
Although we were heavily inspired by the syntax in Ott,
+ − 2109
its definition of $\alpha$-equivalence is unsuitable for our extension of
1760
+ − 2110
Nominal Isabelle. First, it is far too complicated to be a basis for
+ − 2111
automated proofs implemented on the ML-level of Isabelle/HOL. Second, it
+ − 2112
covers cases of binders depending on other binders, which just do not make
2341
+ − 2113
sense for our $\alpha$-equated terms. Third, it allows empty types that have no
2363
+ − 2114
meaning in a HOL-based theorem prover. We also had to generalise slightly Ott's
2163
+ − 2115
binding clauses. In Ott you specify binding clauses with a single body; we
+ − 2116
allow more than one. We have to do this, because this makes a difference
2341
+ − 2117
for our notion of $\alpha$-equivalence in case of \isacommand{bind\_set} and
2363
+ − 2118
\isacommand{bind\_res}. Consider the examples
2163
+ − 2119
+ − 2120
\begin{center}
2341
+ − 2121
\begin{tabular}{@ {}l@ {\hspace{2mm}}l@ {}}
+ − 2122
@{text "Foo\<^isub>1 xs::name fset t::trm s::trm"} &
+ − 2123
\isacommand{bind\_set} @{text "xs"} \isacommand{in} @{text "t s"}\\
+ − 2124
@{text "Foo\<^isub>2 xs::name fset t::trm s::trm"} &
+ − 2125
\isacommand{bind\_set} @{text "xs"} \isacommand{in} @{text "t"},
+ − 2126
\isacommand{bind\_set} @{text "xs"} \isacommand{in} @{text "s"}\\
2163
+ − 2127
\end{tabular}
+ − 2128
\end{center}
+ − 2129
+ − 2130
\noindent
2363
+ − 2131
In the first term-constructor we have a single
2362
+ − 2132
body that happens to be ``spread'' over two arguments; in the second term-constructor we have
+ − 2133
two independent bodies in which the same variables are bound. As a result we
2341
+ − 2134
have
+ − 2135
+ − 2136
\begin{center}
+ − 2137
\begin{tabular}{r@ {\hspace{1.5mm}}c@ {\hspace{1.5mm}}l}
+ − 2138
@{text "Foo\<^isub>1 {a, b} (a, b) (a, b)"} & $\not=$ &
+ − 2139
@{text "Foo\<^isub>1 {a, b} (a, b) (b, a)"}\\
+ − 2140
@{text "Foo\<^isub>2 {a, b} (a, b) (a, b)"} & $=$ &
+ − 2141
@{text "Foo\<^isub>2 {a, b} (a, b) (b, a)"}\\
+ − 2142
\end{tabular}
+ − 2143
\end{center}
+ − 2144
2362
+ − 2145
\noindent
+ − 2146
and therefore need the extra generality to be able to distinguish between
+ − 2147
both specifications.
+ − 2148
Because of how we set up our definitions, we also had to impose some restrictions
+ − 2149
(like a single binding function for a deep binder) that are not present in Ott. Our
1764
+ − 2150
expectation is that we can still cover many interesting term-calculi from
2362
+ − 2151
programming language research, for example Core-Haskell.
2163
+ − 2152
+ − 2153
Pottier presents in \cite{Pottier06} a language, called C$\alpha$ml, for
+ − 2154
representing terms with general binders inside OCaml. This language is
2362
+ − 2155
implemented as a front-end that can be translated to OCaml with the help of
2163
+ − 2156
a library. He presents a type-system in which the scope of general binders
2362
+ − 2157
can be specified using special markers, written @{text "inner"} and
+ − 2158
@{text "outer"}. It seems our and his specifications can be
+ − 2159
inter-translated as long as ours use the binding mode
+ − 2160
\isacommand{bind} only.
+ − 2161
However, we have not proved this. Pottier gives a definition for
+ − 2162
$\alpha$-equivalence, which also uses a permutation operation (like ours).
+ − 2163
Still, this definition is rather different from ours and he only proves that
+ − 2164
it defines an equivalence relation. A complete
2163
+ − 2165
reasoning infrastructure is well beyond the purposes of his language.
2362
+ − 2166
2218
+ − 2167
In a slightly different domain (programming with dependent types), the
+ − 2168
paper \cite{Altenkirch10} presents a calculus with a notion of
2341
+ − 2169
$\alpha$-equivalence related to our binding mode \isacommand{bind\_res}.
2363
+ − 2170
The definition in \cite{Altenkirch10} is similar to the one by Pottier, except that it
2218
+ − 2171
has a more operational flavour and calculates a partial (renaming) map.
2363
+ − 2172
In this way, the definition can deal with vacuous binders. However, to our
+ − 2173
best knowledge, no concrete mathematical result concerning this
+ − 2174
definition of $\alpha$-equivalence has been proved.
1739
+ − 2175
*}
+ − 2176
1493
+ − 2177
section {* Conclusion *}
1485
+ − 2178
+ − 2179
text {*
2362
+ − 2180
We have presented an extension of Nominal Isabelle for dealing with
+ − 2181
general binders, that is term-constructors having multiple bound
+ − 2182
variables. For this extension we introduced novel definitions of
+ − 2183
$\alpha$-equivalence and automated all necessary proofs in Isabelle/HOL.
2363
+ − 2184
To specify general binders we used the syntax from Ott, but modified
+ − 2185
it so that it makes sense in our context of $\alpha$-equated terms.
+ − 2186
We have tried out the extension with terms from Core-Haskell, type-schemes
+ − 2187
and the lambda-calculus, and our code
+ − 2188
will eventually become part of the next Isabelle distribution.\footnote{For the moment
1764
+ − 2189
it can be downloaded from the Mercurial repository linked at
1741
+ − 2190
\href{http://isabelle.in.tum.de/nominal/download}
2361
+ − 2191
{http://isabelle.in.tum.de/nominal/download}.}
1741
+ − 2192
1764
+ − 2193
We have left out a discussion about how functions can be defined over
2362
+ − 2194
$\alpha$-equated terms involving general binders. In earlier versions of Nominal
1764
+ − 2195
Isabelle \cite{UrbanBerghofer06} this turned out to be a thorny issue. We
+ − 2196
hope to do better this time by using the function package that has recently
+ − 2197
been implemented in Isabelle/HOL and also by restricting function
+ − 2198
definitions to equivariant functions (for such functions it is possible to
+ − 2199
provide more automation).
1741
+ − 2200
2363
+ − 2201
There are some restrictions we imposed in this paper that we would like to lift in
1764
+ − 2202
future work. One is the exclusion of nested datatype definitions. Nested
+ − 2203
datatype definitions allow one to specify, for instance, the function kinds
+ − 2204
in Core-Haskell as @{text "TFun string (ty list)"} instead of the unfolded
2362
+ − 2205
version @{text "TFun string ty_list"} (see Figure~\ref{nominalcorehas}). To
+ − 2206
achieve this, we need a slightly more clever implementation than we have at the moment.
1764
+ − 2207
2362
+ − 2208
A more interesting line of investigation is whether we can go beyond the
2363
+ − 2209
simple-minded form of binding functions that we adopted from Ott. At the moment, binding
1764
+ − 2210
functions can only return the empty set, a singleton atom set or unions
+ − 2211
of atom sets (similarly for lists). It remains to be seen whether
2361
+ − 2212
properties like
+ − 2213
%
+ − 2214
\begin{center}
+ − 2215
@{text "fa_ty x = bn x \<union> fa_bn x"}.
+ − 2216
\end{center}
+ − 2217
+ − 2218
\noindent
2362
+ − 2219
allow us to support more interesting binding functions.
1726
+ − 2220
1763
+ − 2221
We have also not yet played with other binding modes. For example we can
2361
+ − 2222
imagine that there is need for a binding mode
1796
5165c350ee1a
clarified comment about distinct lists in th efuture work section
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 2223
where instead of lists, we abstract lists of distinct elements.
5165c350ee1a
clarified comment about distinct lists in th efuture work section
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 2224
Once we feel confident about such binding modes, our implementation
1764
+ − 2225
can be easily extended to accommodate them.
1763
+ − 2226
2362
+ − 2227
\medskip
+ − 2228
\noindent
+ − 2229
{\bf Acknowledgements:} We are very grateful to Andrew Pitts for
+ − 2230
many discussions about Nominal Isabelle. We also thank Peter Sewell for
+ − 2231
making the informal notes \cite{SewellBestiary} available to us and
+ − 2232
also for patiently explaining some of the finer points of the work on the Ott-tool.
+ − 2233
Stephanie Weirich suggested to separate the subgrammars
+ − 2234
of kinds and types in our Core-Haskell example.
2341
+ − 2235
754
+ − 2236
*}
+ − 2237
+ − 2238
(*<*)
+ − 2239
end
1704
+ − 2240
(*>*)