Abstract
I introduce renamingenriched sets (rensets for short), which are algebraic structures axiomatizing fundamental properties of renaming (also known as variableforvariable substitution) on syntax with bindings. Rensets compare favorably in some respects with the wellknown foundation based on nominal sets. In particular, renaming is a more fundamental operator than the nominal swapping operator and enjoys a simpler, equationally expressed relationship with the variablefreshness predicate. Together with some natural axioms matching properties of the syntactic constructors, rensets yield a truly minimalistic characterization of \(\lambda \)calculus terms as an abstract datatype – one involving an infinite set of unconditional equations, referring only to the most fundamental term operators: the constructors and renaming. This characterization yields a recursion principle, which (similarly to the case of nominal sets) can be improved by incorporating Barendregt’s variable convention. When interpreting syntax in semantic domains, my renamingbased recursor is easier to deploy than the nominal recursor. My results have been validated with the proof assistant Isabelle/HOL.
Download conference paper PDF
1 Introduction
Formal reasoning about syntax with bindings is necessary for the metatheory of logics, calculi and programming languages, and is notoriously errorprone. A great deal of research has been put into formal frameworks that make the specification of, and the reasoning about bindings more manageable.
Researchers wishing to formalize work involving syntax with bindings must choose a paradigm for representing and manipulating syntax—typically a variant of one of the “big three”: nameful (sometimes called “nominal” reflecting its best known incarnation, nominal logic [23, 39]), nameless (De Bruijn) [4, 13, 49, 51] and higherorder abstract syntax (HOAS) [19, 20, 28, 34, 35]. Each paradigm has distinct advantages and drawbacks compared with each of the others, some discussed at length, e.g., in [1, 9] and [25, §8.5]. And there are also hybrid approaches, which combine some of the advantages [14, 18, 42, 47].
A significant advantage of the nameful paradigm is that it stays close to the way one informally defines and manipulates syntax when describing systems in textbooks and research papers—where the binding variables are explicitly indicated. This can in principle ensure transparency of the formalization and allows the formalizer to focus on the highlevel ideas. However, it only works if the technical challenge faced by the nameful paradigm is properly addressed: enabling the seamless definition and manipulation of concepts “up to alphaequivalence”, i.e., in such a way that the names of the bound variables are (present but nevertheless) inconsequential. This is particularly stringent in the case of recursion due to the binding constructors of terms not being free, hence not being a priori traversable recursively—in that simply writing some recursive clauses that traverse the constructors is not a priori guaranteed to produce a correct definition, but needs certain favorable conditions. The problem has been addressed by researchers in the form of tailored nameful recursors [23, 33, 39, 43, 56, 57], which are theorems that identify such favorable conditions and, based on them, guarantee the existence of functions that recurse over the nonfree constructors.
In this paper, I make a contribution to the nameful paradigm in general, and to nameful recursion in particular. I introduce rensets, which are algebraic structures axiomatizing the properties of renaming, also known as variableforvariable substitution, on terms with bindings (Sect. 3). Rensets differ from nominal sets (Sect. 2.2), which form the foundation of nominal logic, by their focus on (not necessarily injective) renaming rather than swapping (or permutation). Similarly to nominal sets, rensets are pervasive: Not only do the variables and terms form rensets, but so do any containertype combinations of rensets.
While lacking the pleasant symmetry of swapping, my axiomatization of renaming has its advantages. First, renaming is more fundamental than swapping because, at an abstract axiomatic level, renaming can define swapping but not vice versa (Sect. 4). The second advantage is about the ability to define another central operator: the variable freshness predicate. While the definability of freshness from swapping is a signature trait of nominal logic, my renamingbased alternative fares even better: In rensets freshness has a simple, firstorder definition (Sect. 3). This contrasts the nominal logic definition, which involves a secondorder statement about (co)finiteness of a set of variables. The third advantage is largely a consequence of the second: Rensets enriched with constructorlike operators facilitate an equational characterization of terms with bindings (using an infinite set of unconditional equations), which does not seem possible for swapping (Sect. 5.1). This produces a recursion principle (Sect. 5.2) which, like the nominal recursor, caters for Barendregt’s variable convention, and in some cases is easier to apply than the nominal recursor—for example when interpreting syntax in semantic domains (Sect. 5.3).
In summary, I argue that my renamingbased axiomatization offers some benefits that strengthen the arsenal of the nameful paradigm: a simpler representation of freshness, a minimalistic equational characterization of terms, and a convenient recursion principle. My results are established with high confidence thanks to having been mechanized in Isabelle/HOL [32]. The mechanization is available [44] from Isabelle’s Archive of Formal Proofs.
Here is the structure of the rest of this paper: Sect. 2 provides background on terms with bindings and on nominal logic. Section 3 introduces rensets and describes their basic properties. Section 4 establishes a formal connection to nominal sets. Section 5 discusses substitutivesetbased recursion. Section 6 discusses related work. A technical report [45] associated to this paper includes an appendix with more examples and results and more background on nominal sets.
2 Background
This section recalls the terms of \(\lambda \)calculus and their basic operators (Sect. 2.1), and aspects of nominal logic including nominal sets and nominal recursion (Sect. 2.2).
2.1 Terms with Bindings
I work with the paradigmatic syntax of (untyped) \(\lambda \)calculus. However, my results generalize routinely to syntaxes specified by arbitrary binding signatures such as the ones in [22, §2], [39, 59] or [12].
Let \(\mathsf {{Var}}\) be a countably infinite set of variables, ranged over by x, y, z etc. The set \(\mathsf {Trm}\) of \(\lambda \)terms (or terms for short), ranged over by \(t,t_1,t_2\) etc., is defined by the grammar \( t \;{:}{:}\!=\; \mathsf {{Vr}}\;x \;\mid \; \mathsf {{Ap}}\;t_1\;t_2 \;\mid \; \mathsf {{Lm}}\;x\;t \)
with the proviso that terms are equated (identified) modulo alphaequivalence (also known as naming equivalence). Thus, for example, if \(x \not = z \not = y\) then \(\mathsf {{Lm}}\;x\;(\mathsf {{Ap}}\;(\mathsf {{Vr}}\;x)\;(\mathsf {{Vr}}\;z))\) and \(\mathsf {{Lm}}\;y\;(\mathsf {{Ap}}\;(\mathsf {{Vr}}\;y)\;(\mathsf {{Vr}}\;z))\) are considered to be the same term. I will often omit \(\mathsf {{Vr}}\) when writing terms, as in, e.g., \(\mathsf {{Lm}}\;x\;x\).
What the above specification means is (something equivalent to) the following: One first defines the set \(\mathsf {PTrm}\) of preterms as freely generated by the grammar \( p \;{:}{:}\!\!=\; \mathsf {{PVr}}\;x \,\mid \, \mathsf {{PAp}}\;p_1\;p_2 \,\mid \, \mathsf {{PLm}}\;x\;p \). Then one defines the alphaequivalence relation \(\equiv \; : \mathsf {PTrm}\rightarrow \mathsf {PTrm}\rightarrow \textsf {Bool}\) inductively, proves that it is an equivalence, and defines \(\mathsf {Trm}\) by quotienting \(\mathsf {PTrm}\) to alphaequivalence, i.e., \(\mathsf {Trm}= \mathsf {PTrm}/\!\equiv \). Finally, one proves that the preterm constructors are compatible with \(\equiv \), and defines the term counterpart of these constructors: \(\mathsf {{Vr}}: \mathsf {{Var}}\rightarrow \mathsf {Trm}\), \(\mathsf {{Ap}}: \mathsf {Trm}\rightarrow \mathsf {Trm}\rightarrow \mathsf {Trm}\) and \(\mathsf {{Lm}}: \mathsf {{Var}}\rightarrow \mathsf {Trm}\rightarrow \mathsf {Trm}\).
The above constructions are technical, but wellunderstood, and can be fully automated for an arbitrary syntax with bindings (not just that of \(\lambda \)calculus); and tools such as the Isabelle/Nominal package [59, 60] provide this automation, hiding preterms completely from the end user. In formal and informal presentations alike, one usually prefers to forget about preterms, and work with terms only. This has several advantages, including (1) being able to formalize concepts at the right abstraction level (since in most applications the naming of bound variables should be inconsequential) and (2) the renaming operator being wellbehaved. However, there are some difficulties that need to be overcome when working with terms, and in this paper I focus on one of the major ones: providing recursion principles, i.e., mechanisms for defining functions by recursing over terms. This difficulty arises essentially because, unlike in the case of preterm constructors, the binding constructor for terms is not free.
The main characters of my paper will be (generalizations of) some common operations and relations on \(\mathsf {Trm}\), namely:

the constructors \(\mathsf {{Vr}}: \mathsf {{Var}}\rightarrow \mathsf {Trm}\), \(\mathsf {{Ap}}: \mathsf {Trm}\rightarrow \mathsf {Trm}\rightarrow \mathsf {Trm}\) and \(\mathsf {{Lm}}: \mathsf {{Var}}\rightarrow \mathsf {Trm}\rightarrow \mathsf {Trm}\)

(captureavoiding) renaming, also known as (captureavoiding) substitution of variables for variables \(\_[\_/\!\_] : \mathsf {Trm}\rightarrow \mathsf {{Var}}\rightarrow \mathsf {{Var}}\rightarrow \mathsf {Trm}\); e.g., we have \((\mathsf {{Lm}}\;x\;(\mathsf {{Ap}}\;x\;y))\;[x / y] = \mathsf {{Lm}}\;x'\;(\mathsf {{Ap}}\;x'\;x)\)

swapping \(\_[\_\!\wedge \!\_]: \mathsf {Trm}\rightarrow \mathsf {{Var}}\rightarrow \mathsf {{Var}}\rightarrow \mathsf {Trm}\); e.g., we have \((\mathsf {{Lm}}\;x\;(\mathsf {{Ap}}\;x\;y))\,[x \wedge y] = \mathsf {{Lm}}\;y\;(\mathsf {{Ap}}\;y\;x)\)

the freevariable operator \({{\mathsf {FV}}}: \mathsf {Trm}\rightarrow {{\mathsf {Pow}}}(\mathsf {{Var}})\) (where \({{\mathsf {Pow}}}(\mathsf {{Var}})\) is the powerset of \(\mathsf {{Var}}\)); e.g., we have \({{\mathsf {FV}}}(\mathsf {{Lm}}\;x\;(\mathsf {{Ap}}\;y\;x)) = \{y\}\)

freshness \(\_\#\_ : \mathsf {{Var}}\rightarrow \mathsf {Trm}\rightarrow \textsf {Bool}\); e.g., we have \(x \,\#\, (\mathsf {{Lm}}\;x\;x)\); and assuming \(x\not =y\), we have \(\lnot \;x \,\#\, (\mathsf {{Lm}}\;y\;x)\)
The freevariable and freshness operators are of course related: A variable x is fresh for a term t (i.e., \(x \,\#\, t\)) if and only if it is not free in t (i.e., \(x \notin {{\mathsf {FV}}}(t)\)). The renaming operator \(\_[\_/\!\_] : \mathsf {Trm}\rightarrow \mathsf {{Var}}\rightarrow \mathsf {{Var}}\rightarrow \mathsf {Trm}\) substitutes (in terms) variables for variables, not terms for variables. (But an algebraization of termforvariable substitution is discussed in [45, Appendix D].)
2.2 Background on Nominal Logic
I will employ a formulation of nominal logic [38, 39, 57] that does not require any special logical foundation, e.g., axiomatic nominal set theory. For simplicity, I prefer the swappingbased formulation [38] to the equivalent permutationbased formulation—[45, Appendix C] gives details on these two alternatives.
A prenominal set is a pair \(\mathcal {A}= (A,\_[\_\!\wedge \!\_])\) where A is a set and \(\_[\_\!\wedge \!\_]: A \rightarrow \mathsf {{Perm}}\rightarrow A\) is a function called the swapping operator of \(\mathcal {A}\) satisfying the following properties for all \(a\in A\) and \(x,x_1,x_2,y_1,y_2\in \mathsf {{Var}}\):
 Identity: :

\(a[x\wedge x] = a\)
 Involution: :

\(a[x_1\wedge x_2][x_1\wedge x_2] = a\)
 Compositionality: :

\(a[x_1 \wedge x_2] [y_1\wedge y_2] = a[y_1\wedge y_2][(x_1[y_1\wedge y_2]) \wedge (x_2[y_1\wedge y_2] )]\)
Given a prenominal set \(\mathcal {A}= (A,\_[\_\!\wedge \!\_])\), an element \(a\in A\) and a set \(X\subseteq \mathsf {{Var}}\), one says that a is supported by X if \(a [x \wedge y] = a\) holds for all \(x,y\in \mathsf {{Var}}\) such that \(x,y\notin X\). An element \(a\in A\) is called finitely supported if there exists a finite set \(X\subseteq A\) such that a is supported by X. A nominal set is a prenominal set \(\mathcal {A}= (A,\_[\_\!\wedge \!\_])\) such that every element of a is finitely supported. If \(\mathcal {A}= (A,\_[\_\!\wedge \!\_])\) is a nominal set and \(a\in A\), then the smallest set \(X\subseteq A\) such that a is supported by X exists, and is denoted by \({{\mathsf {supp}}}^\mathcal {A}\,a\) and called the support of a. One calls a variable x fresh for a, written \(x \,\#\,a\), if \(x\notin {{\mathsf {supp}}}^\mathcal {A}\,a\).
An alternative, more direct definition of freshness (which is preferred, e.g., by Isabelle/Nominal [59, 60]) is provided by the following proposition:
Proposition 1
For any nominal set \(\mathcal {A}= (A,\_[\_\!\wedge \!\_])\) and any \(x\in \mathsf {{Var}}\) and \(a\in A\), it holds that \(x \,\#\, a\) if and only if the set \(\{y \mid a[y\wedge x] \not = a\}\) is finite.
Given two prenominal sets \(\mathcal {A}= (A,\_[\_\!\wedge \!\_])\) and \(\mathcal {B}= (B,\_[\_\!\wedge \!\_])\), the set \(F = (A \rightarrow B)\) of functions from A to B becomes a prenominal set \(\mathcal {F}= (F,\_[\_\!\wedge \!\_])\) by defining \(f[x \wedge y]\) to send each \(a\in A\) to \((f(a[x\wedge y]))[x \wedge y]\). \(\mathcal {F}\) is not a nominal set because not all functions are finitely supported (though of course one obtains a nominal set by restricting to finitely supported functions).
The set of terms together with their swapping operator, \((\mathsf {Trm},\_[\_\!\wedge \!\_])\), forms a nominal set, where the support of a term is precisely its set of free variables. However, the power of nominal logic resides in the fact that not only the set of terms, but also many other sets can be organized as nominal sets—including the target domains of many functions one may wish to define on terms. This gives rise to a convenient mechanism for defining functions recursively on terms:
Theorem 2
[39]. Let \(\mathcal {A}= (A,\_[\_])\) be a nominal set and let \(\mathsf {{Vr}}^\mathcal {A}: \mathsf {{Var}}\rightarrow A\), \(\mathsf {{Ap}}^\mathcal {A}: A \rightarrow A \rightarrow A\) and \(\mathsf {{Lm}}^\mathcal {A}: \mathsf {{Var}}\rightarrow A \rightarrow A\) be some functions, all supported by a finite set X of variables and with \(\mathsf {{Lm}}^\mathcal {A}\) satisfying the following freshness condition for binders (FCB): There exists \(x\in \mathsf {{Var}}\) such that \(x\notin X\) and \(x \,\#\,\, \mathsf {{Lm}}^\mathcal {A}\;x\;a\) for all \(a \in A\).
Then there exists a unique function \(f: \mathsf {Trm}\rightarrow A\) that is supported by X and such that the following hold for all \(x\in \mathsf {{Var}}\) and \(t_1,t_2,t\in \mathsf {Trm}\):
A useful feature of nominal recursion is the support for Barendregt’s famous variable convention [8, p. 26]: “If [the terms] \(t_1,\ldots ,t_n\) occur in a certain mathematical context (e.g. definition, proof), then in these terms all bound variables are chosen to be different from the free variables.” The above recursion principle adheres to this convention by fixing a finite set X of variables meant to be free in the definition context and guaranteeing that the bound variables in the definitional clauses are distinct from them. Formally, the target domain operators \(\mathsf {{Vr}}^\mathcal {A}\), \(\mathsf {{Ap}}^\mathcal {A}\) and \(\mathsf {{Lm}}^\mathcal {A}\) are supported by X, and the clause for \(\lambda \)abstraction is conditioned by the binding variable x being outside of X. (The Barendregt convention is also present in nominal logic via induction principles [39, 58,59,60].)
3 Rensets
This section introduces rensets, an alternative to nominal sets that axiomatize renaming rather than swapping or permutation.
A renamingenriched set (renset for short) is a pair \(\mathcal {A}= (A,\_[\_/\!\_])\) where A is a set and \(\_[\_/\!\_] : A \rightarrow \mathsf {{Var}}\rightarrow \mathsf {{Var}}\rightarrow A\) is an operator such that the following hold for all \(x,x_1,x_2, x_3,y,y_1,y_2 \in \mathsf {{Var}}\) and \(a\in A\):
 Identity: :

\(a[x/x] = a\)
 Idempotence: :

If \(x_1\not =y\) then \(a[x_1/y][x_2/y] = a[x_1/y]\)
 Chaining: :

If \(y\not =x_2\) then \(a[y/x_2][x_2/x_1] [x_3/x_2]= a[y/x_2][x_3/x_1]\)
 Commutativity: :

If \(x_2 \not = y_1 \not = x_1 \not = y_2\) then \(a[x_2/x_1] [y_2/y_1]= a[y_2/y_1][x_2/x_1]\)
Let us call A the carrier of \(\mathcal {A}\) and \(\_[\_/\!\_] \) the renaming operator of \(\mathcal {A}\). Similarly to the case of terms, we think of the elements \(a\in A\) as some kind of variablebearing entities and of a[y/x] as the result of substituting x with y in a. With this intuition, the above properties are natural: Identity says that substituting a variable with itself has no effect. Idempotence acknowledges the fact that, after its renaming, a variable y is no longer there, so substituting it again has no effect. Chaining says that a chain of renamings \(x_3/x_2/x_1\) has the same effect as the endtoend renaming \(x_3/x_1\) provided there is no interference from \(x_2\), which is ensured by initially substituting \(x_2\) with some other variable y. Finally, Commutativity allows the reordering of any two independent renamings.
Examples. \((\mathsf {{Var}},\_[\_/\!\_])\) and \((\mathsf {Trm},\_[\_/\!\_])\), the sets of variables and terms with the standard renaming operator on them, form rensets. Moreover, given any functor F on the category of sets and a renset \(\mathcal {A}= (A,\_[\_/\!\_])\), let us define the renset \(F\,\mathcal {A}= (F\,A,\_[\_/\!\_])\) as follows: for any \(k \in F\,A\) and \(x,y\in \mathsf {{Var}}\), \(k[x/y] = F\,(\_[x/y])\,k\), where the last occurrence of F refers to the action of the functor on morphisms. This means that one can freely build new rensets from existing ones using container types (which are particular kinds of functors)—e.g., lists, sets, trees etc. Another way to put it: Rensets are closed under datatype and codatatype constructions [55].
In what follows, let us fix a renset \(\mathcal {A}= (A,\_[\_/\!\_])\). One can define the notion of freshness of a variable for an element of a in the style of nominal logic. But the next proposition shows that simpler formulations are available.
Proposition 3
The following are equivalent:
(1) The set \(\{y \in \mathsf {{Var}}\mid a[y/x] \not = a\}\) is finite.
(2) \(a[y/x] = a\) for all \(y \in \mathsf {{Var}}\). (3) \(a[y/x] = a\) for some \(y \in \mathsf {{Var}}\smallsetminus \{x\}\).
Let us define the predicate \(\_\,\#\,\!\_ : \mathsf {{Var}}\rightarrow A \rightarrow \textsf {Bool}\) as follows: \(x\,\#\, a\), read x is fresh for a, if either of Proposition 3’s equivalent properties holds.
Thus, points (1)–(3) above are three alternative formulations of \(x\,\#\, a\), all referring to the lack of effect of substituting y for x, expressed as \(a[y/x] = a\): namely that this phenomenon affects (1) all but a finite number of variables y, (2) all variables y, or (3) some variable \(y\not =x\). The first formulation is the most complex of the three—it is the nominal definition, but using renaming instead of swapping. The other two formulations do not have counterparts in nominal logic, essentially because swapping is not as “efficient” as renaming at exposing freshness. In particular, (3) does not have a nominal counterpart because there is no singleswapping litmus test for freshness. The closest we can get to property (3) in a nominal set is the following: x is fresh for a if and only \(a[y \wedge x] = a\) holds for some fresh y—but this needs freshness to explain freshness!
Examples (continued). For the rensets of variables and terms, freshness defined as above coincides with the expected operators: distinctness in the case of variables and standard freshness in the case of terms. And applying the definition of freshness to rensets obtained using finitary container types has similarly intuitive outcomes; for example, the freshness of a variable x for a list of items \([a_1,\ldots ,a_n]\) means that x is fresh for each item \(a_i\) in the list.
Freshness satisfies some intuitive properties, which can be easily proved from its definition and the renset axioms. In particular, point (2) of the next proposition is the freshnessbased version of the Chaining axiom.
Proposition 4
The following hold:
(1) If \(x\,\#\, a\) then \(a[y/x] = a\) (2) \(x_2\, \#\, a\) then \(a[x_2/x_1] [x_3/x_2]= a[x_3/x_1]\)
(3) If \(z\, \#\, a\) or \(z=x\), and \(x \,\#\, a\) or \(z\not = y\), then \(z \,\#\, a[y/x]\)
4 Connection to Nominal Sets
So far I focused on consequences of the purely equational theory of rensets, without making any assumption about cardinality. But after additionally postulating a nominalstyle finite support property, one can show that rensets give rise to nominal sets—which is what I will do in this section.
Let us say that a renset \(\mathcal {A}= (A,\_[\_/\!\_])\) has the Finite Support property if, for all \(a\in A\), the set \(\{x\in \mathsf {{Var}}\mid \lnot \;x\,\#\, a\}\) is finite.
Let \(\mathcal {A}= (A,\_[\_/\!\_])\) be a renset satisfying Finite Support. Let us define the swapping operator \(\_[\_\!\wedge \!\_]: A \rightarrow \mathsf {{Var}}\rightarrow \mathsf {{Var}}\rightarrow A\) as follows: \(a[x_1\wedge x_2] = a [y/x_1][x_1/x_2][x_2/y]\), where y is a variable that is fresh for all the involved items, namely \(y\notin \{x_1,x_2\}\) and \(y \,\#\, a\). Indeed, this is how one would define swapping from renaming on terms: using a fresh auxiliary variable y, and exploiting that such a fresh y exists and that its choice is immaterial for the end result. The next lemma shows that this style of definition also works abstractly, i.e., all it needs are the renset axioms plus Finite Support.
Lemma 5
The following hold for all \(x_1,x_2\in \mathsf {{Var}}\) and \(a\in A\):

(1)
There exists \(y\in \mathsf {{Var}}\) such that \(y\notin \{x_1,x_2\}\) and \(y\, \#\, a\).

(2)
For all \(y,y' \in \mathsf {{Var}}\) such that \(y\notin \{x_1,x_2\}\), \(y\, \#\, a\), \(y'\notin \{x_1,x_2\}\) and \(y' \#\, a\), \(a [y/x_1][x_1/x_2][x_2/y] = a [y'/x_1][x_1/x_2][x_2/y']\).
And one indeed obtains an operator satisfying the nominal axioms:
Proposition 6
If \((A,\_[\_/\!\_])\) is a renset satisfying Finite Support, then \((A,\_[\_\!\wedge \!\_])\) is a nominal set. Moreover, \((A,\_[\_/\!\_])\) and \((A,\_[\_\!\wedge \!\_])\) have the same notion of freshness, in that the freshness operator defined from renaming coincides with that defined from swapping.
The above construction is functorial, as I detail next. Given two nominal sets \(\mathcal {A}= (A,\_[\_\!\wedge \!\_])\) and \(\mathcal {B}= (B,\_[\_\!\wedge \!\_])\), a nominal morphism \(f:\mathcal {A}\rightarrow \mathcal {B}\) is a function \(f:A\rightarrow B\) with the property that it commutes with swapping, in that \((f\;a)[x \wedge y] = f(a[x \wedge y])\) for all \(a\in A\) and \(x,y\in \mathsf {{Var}}\). Nominal sets and nominal morphisms form a category that I will denote by \(\underline{ Nom }\). Similarly, let us define a morphism \(f:\mathcal {A}\rightarrow \mathcal {B}\) between two rensets \(\mathcal {A}= (A,\_[\_/\!\_])\) and \(\mathcal {B}= (B,\_[\_])\) to be a function \(f:A\rightarrow B\) that commutes with renaming, yielding the category \(\underline{ Sbs }\) of rensets. Let us write \(\underline{ FSbs }\) for the full subcategory of \(\underline{ Sbs }\) given by rensets that satisfy Finite Support. Let us define \(F: \underline{ FSbs }\rightarrow \underline{ Nom }\) to be an operator on objects and morphisms that sends each finitesupport renset to the above described nominal set constructed from it, and sends each substitutive morphism to itself.
Theorem 7
F is a functor between \(\underline{ FSbs }\) and \(\underline{ Nom }\) which is injective on objects and full and faithful (i.e., bijective on morphisms).
One may ask whether it is also possible to make the trip back: from nominal to rensets. The answer is negative, at least if one wants to retain the same notion of freshness, i.e., have the freshness predicate defined in the nominal set be identical to the one defined in the resulting renset. This is because swapping preserves the cardinality of the support, whereas renaming must be allowed to change it since it might perform a noninjective renaming. The following example captures this idea:
Counterexample. Let \(\mathcal {A}= (A,\_[\_\!\wedge \!\_])\) be a nominal set such that all elements of A have their support consisting of exactly two variables, x and y (with \(x\not =y\)). (For example, A can be the set of all terms with these free variables—this is indeed a nominal subset of the term nominal set because it is closed under swapping.) Assume for a contradiction that \(\_[\_/\!\_]\) is an operation on A that makes \((A,\_[\_/\!\_])\) a renset with its induced freshness operator equal to that of \(\mathcal {A}\). Then, by the definition of A, a[y/x] needs to have exactly two nonfresh variables. But this is impossible, since by Proposition 4(3), all the variables different from y (including x) must be fresh for a[y/x]. In particular, \(\mathcal {A}\) is not in the image of the functor \(F:\underline{ FSbs }\rightarrow \underline{ Nom }\), which is therefore not surjective on objects.
Thus, at an abstract algebraic level renaming can define swapping, but not the other way around. This is not too surprising, since swapping is fundamentally bijective whereas renaming is not; but it further validates our axioms for renaming, highlighting their ability to define a wellbehaved swapping.
5 Recursion Based on Rensets
Proposition 3 shows that, in rensets, renaming can define freshness using only equality and universal or existential quantification over variables—without needing any cardinality condition like in the case of swapping. As I am about to discuss, this forms the basis of a characterization of terms as the initial algebra of an equational theory (Sect. 5.1) and an expressive recursion principle (Sect. 5.2) that fares better than the nominal one for interpretations in semantic domains (Sect. 5.3).
5.1 Equational Characterization of the Term Datatype
Rensets contain elements that are “termlike” in as much as there is a renaming operator on them satisfying familiar properties of renaming on terms. This similarity with terms can be strengthened by enriching rensets with operators having arities that match those of the term constructors.
A constructorenriched renset (CE renset for short) is a tuple \(\mathcal {A}= (A,\_[\_/\!\_],\mathsf {{Vr}}^\mathcal {A},\mathsf {{Ap}}^\mathcal {A},\mathsf {{Lm}}^\mathcal {A})\) where:

\((A,\_[\_/\!\_])\) is a renset

\(\mathsf {{Vr}}^\mathcal {A}: \mathsf {{Var}}\rightarrow A\), \(\mathsf {{Ap}}^\mathcal {A}: A \rightarrow A \rightarrow A\) and \(\mathsf {{Lm}}^\mathcal {A}: \mathsf {{Var}}\rightarrow A \rightarrow A\) are functions
such that the following hold for all \(a,a_1,a_2\in A\) and \(x,y,z\in \mathsf {{Var}}\):

(S1) \((\mathsf {{Vr}}^\mathcal {A}\;x)[y/z] = \mathsf {{Vr}}^\mathcal {A}(x[y/z])\)

(S2) \((\mathsf {{Ap}}^\mathcal {A}\;a_1\;a_2)[y/z] = \mathsf {{Ap}}^\mathcal {A}(a_1[y/z])\,(a_2[y/z])\)

(S3) if \(x\notin \{y,z\}\) then \((\mathsf {{Lm}}^\mathcal {A}\,x\;a)[y/z] = \mathsf {{Lm}}^\mathcal {A}\,x\,(a[y/z])\)

(S4) \((\mathsf {{Lm}}^\mathcal {A}\,x\;a)[y/x] = \mathsf {{Lm}}^\mathcal {A}\,x\;a\)

(S5) if \(z\not =y\) then \(\mathsf {{Lm}}^\mathcal {A}\,x\;(a[z/y]) = \mathsf {{Lm}}^\mathcal {A}\,y\;(a[z/y][y/x])\)
Let us call \(\mathsf {{Vr}}^\mathcal {A},\mathsf {{Ap}}^\mathcal {A},\mathsf {{Lm}}^\mathcal {A}\) the constructors of \(\mathcal {A}\). (S1)–(S3) express the constructors’ commutation with renaming (with captureavoidance provisions in the case of (S3)), (S4) the lack of effect of substituting for a bound variable, and (S5) the possibility to rename a bound variable without changing the abstracted item (where the inner renaming of \(z\not = y\) for y ensures the freshness of the “new name” y, hence its lack of interference with the other names in the “termlike” entity where the renaming takes place). All these are wellknown to hold for terms:
Example. Terms with renaming and the constructors, namely \( (\mathsf {Trm},\_[\_/\!\_],\mathsf {{Vr}},\mathsf {{Ap}},\mathsf {{Lm}})\), form a CE renset which will be denoted by \(\mathcal {T}rm\).
As it turns out, the CE renset axioms capture exactly the term structure \(\mathcal {T}rm\), via initiality. The notion of CE substitutive morphism \(f:\mathcal {A}\rightarrow \mathcal {B}\) between two CE rensets \(\mathcal {A}= (A,\_[\_/\!\_],\mathsf {{Vr}}^\mathcal {A},\mathsf {{Ap}}^\mathcal {A},\mathsf {{Lm}}^\mathcal {A})\) and \(\mathcal {B}= (B,\_[\_/\!\_],\mathsf {{Vr}}^\mathcal {B},\mathsf {{Ap}}^\mathcal {B},\mathsf {{Lm}}^\mathcal {B})\) is the expected one: a function \(f:A\rightarrow B\) that is a substitutive morphism and also commutes with the constructors. Let us write \(\underline{ Sbs }_{\mathsf {CE}}\) for the category of CE rensets and morphisms.
Theorem 8
\(\mathcal {T}rm\) is the initial CE renset, i.e., initial object in \(\underline{ Sbs }_{\mathsf {CE}}\).
Proof Idea. Let \(\mathcal {A}= (A,\_[\_/\!\_],\mathsf {{Vr}}^\mathcal {A},\mathsf {{Ap}}^\mathcal {A},\mathsf {{Lm}}^\mathcal {A})\) be a CE renset. Instead of directly going after a function \(f: \mathsf {Trm}\rightarrow A\), one first inductively defines a relation \(R : \mathsf {Trm}\rightarrow A \rightarrow \textsf {Bool}\), with inductive clauses reflecting the desired properties concerning the commutation with the constructors, e.g., \(\frac{R\;t\;a}{R\;(\mathsf {{Lm}}\;x\;t)\;(\mathsf {{Lm}}^\mathcal {A}\;x\;a)}\). It suffices to prove that R is total and functional and preserves renaming, since that allows one to define a constructor and renamingpreserving function (a morphism) f by taking \(f\;t\) to be the unique a with \(R\;t\;a\).
Proving that R is total is easy by standard induction on terms. Proving the other two properties, namely functionality and preservation of renaming, is more elaborate and requires their simultaneous proof together with a third property: that R preserves freshness. The simultaneous threeproperty proof follows by a form of “substitutive induction” on terms: Given a predicate \(\phi : \mathsf {Trm}\rightarrow \textsf {Bool}\), to show \(\forall t\in \mathsf {Trm}.\;\phi \;t\) it suffices to show the following: (1) \(\forall x\in \mathsf {{Var}}.\;\phi \;(\mathsf {{Vr}}\;x)\), (2) \( \forall t_1,t_2\in \mathsf {Trm}.\;\phi \;t_1 \, \& \, \phi \;t_2 \rightarrow \phi \,(\mathsf {{Ap}}\;t_1\;t_2)\), and (3) \(\forall x\in \mathsf {{Var}},\,t\in \mathsf {Trm}.\;(\forall s\in \mathsf {Trm}.\; \mathsf {Con}_{\tiny \_[\_/\!\_]}\;t\;s \rightarrow \phi \;s) \rightarrow \phi \,(\mathsf {{Lm}}\;x\;t)\), where \(\mathsf {Con}_{\tiny \_[\_/\!\_]}\;t\;s\) means that t is connected to s by a chain of renamings.
Roughly speaking, R turns out to be functional because the \(\lambda \)abstraction operator on the “termlike” inhabitants of A is, thanks to the axioms of CE renset, at least as noninjective as (i.e., identifies at least as many items as) the \(\lambda \)abstraction operator on terms. \(\square \)
Theorem 8 is the central result of this paper, from both practical and theoretical perspectives. Practically, it enables a useful form of recursion on terms (as I will discuss in the following sections). Theoretically, this is a characterization of terms as the initial algebra of an equational theory that only the most fundamental term operations, namely the constructors and renaming. The equational theory consists of the axioms of CE rensets (i.e., those of rensets plus (S1)–(S5)), which are an infinite set of unconditional equations—for example, axiom (S5) gives one equation for each pair of distinct variables y, z.
It is instructive to compare this characterization with the one offered by nominal logic, namely by Theorem 2. To do this, one first needs a lemma:
Lemma 9
Let \(f: A \rightarrow B\) be a function between two nominal sets \(\mathcal {A}= (A,\_[\_\!\wedge \!\_])\) and \(\mathcal {B}= (B,\_[\_\!\wedge \!\_])\) and X a set of variables. Then f is supported by X if and only if \(f(a[x\wedge y]) = (f\,a)[x\wedge y]\) for all \(x,y\in \mathsf {{Var}}\smallsetminus X\).
Now Theorem 2 (with the variable avoidance set X taken to be \(\emptyset \)) can be rephrased as an initiality statement, as I describe below.
Let us define a constructorenriched nominal set (CE nominal set) to be any tuple \(\mathcal {A}= (A,\_[\_\!\wedge \!\_],\mathsf {{Vr}}^\mathcal {A},\mathsf {{Ap}}^\mathcal {A},\mathsf {{Lm}}^\mathcal {A})\) where \((A,\_[\_\!\wedge \!\_])\) is a nominal set and \(\mathsf {{Vr}}^\mathcal {A}: \mathsf {{Var}}\rightarrow A\), \(\mathsf {{Ap}}^\mathcal {A}: A \rightarrow A \rightarrow A\), \(\mathsf {{Lm}}^\mathcal {A}: \mathsf {{Var}}\rightarrow A \rightarrow A\) are operators on A such that the following properties hold for all \(a,a_1,a_2\in A\) and \(x,y,z\in \mathsf {{Var}}\):

(N1) \((\mathsf {{Vr}}^\mathcal {A}\;x)[y \wedge z] = \mathsf {{Vr}}^\mathcal {A}(x[y \wedge z])\)

(N2) \((\mathsf {{Ap}}^\mathcal {A}\;a_1\;a_2)[y \wedge z]= \mathsf {{Ap}}^\mathcal {A}(a_1[y \wedge z])\,(a_2[y \wedge z])\)

(N3) \((\mathsf {{Lm}}^\mathcal {A}\,x\;a)[y \wedge z] = \mathsf {{Lm}}^\mathcal {A}\;(x[y \wedge z])\;(a[y \wedge z])\)

(N4) \(x \,\#\, \mathsf {{Lm}}\;x\;a\), i.e., \(\{y \in \mathsf {{Var}}\mid (\mathsf {{Lm}}\;x\;a)[y \wedge x] \not = \mathsf {{Lm}}\;x\;a\}\) is finite.
The notion of CE nominal morphism is defined as the expected extension of that of nominal morphism: a function that commutes with swapping and the constructors. Let \(\underline{ Nom }_{\mathsf {CE}}\) be the category of CE nominal sets morphisms.
Theorem 10
([39], rephrased). \((\mathsf {Trm},\_[\_\!\wedge \!\_],\mathsf {{Vr}},\mathsf {{Ap}},\mathsf {{Lm}})\) is the initial CE nominal set, i.e., the initial object in \(\underline{ Nom }_{\mathsf {CE}}\).
The above theorem indeed corresponds exactly to Theorem 2 with \(X=\emptyset \):

the conditions (N1)–(N3) in the definition of CE nominal sets correspond (via Lemma 9) to the constructors being supported by \(\emptyset \)

(N4) is the freshness condition for binders

initiality, i.e., the existence of a unique morphism, is the same as the existence of the unique function \(f: \mathsf {Trm}\rightarrow A\) stipulated in Theorem 2: commutation with the constructors is the Theorem 2 conditions (i)–(iii), and commutation with swapping means (via Lemma 9) f being supported by \(\emptyset \).
Unlike the renamingbased characterization of terms (Theorem 8), the nominal logic characterization (Theorem 10) is not purely equational. This is due to a combination of two factors: (1) two of the axioms ((N4) and the Finite Support condition) referring to freshness and (2) the impossibility of expressing freshness equationally from swapping. The problem seems fundamental, in that a nominalstyle characterization does not seem to be expressible purely equationally. By contrast, while the freshness idea is implicit in the CE renset axioms, the freshness predicate itself is absent from Theorem 8.
5.2 BarendregtEnhanced Recursion Principle
While Theorem 8 already gives a recursion principle, it is possible to improve it by incorporating Barendregt’s variable convention (in the style of Theorem 2):
Theorem 11
Let X be a finite set, \((A,\_[\_/\!\_])\) a renset and \(\mathsf {{Vr}}^\mathcal {A}: \mathsf {{Var}}\rightarrow A\), \(\mathsf {{Ap}}^\mathcal {A}: A \rightarrow A \rightarrow A\) and \(\mathsf {{Lm}}^\mathcal {A}: \mathsf {{Var}}\rightarrow A \rightarrow A\) some functions that satisfy the clauses (S1)–(S5) from the definition of CE renset, but only under the assumption that \(x,y,z\notin X\). Then there exists a unique function \(f: \mathsf {Trm}\rightarrow A\) such that th following hold:
Proof Idea. The constructions in the proof of Theorem 8 can be adapted to avoid clashing with the finite set of variables X. For example, the clause for \(\lambda \)abstraction in the inductive definition of the relation R becomes \(\frac{x \not \in X\;\;\;\;\;\;\;\;R\;t\;a}{R\;(\mathsf {{Lm}}\;x\;t)\;(\mathsf {{Lm}}^\mathcal {A}\,x\;a)}\) and preservation of renaming and freshness are also formulated to avoid X. Totality is still ensured thanks to the possibility of renaming bound variables—in terms and inhabitants of A alike (via the modified axiom (S5)). \(\square \)
The above theorem says that if the structure \(\mathcal {A}\) is assumed to be “almost” a CE set, save for additional restrictions involving the avoidance of X, then there exists a unique “almost”morphism—satisfying the CE substitutive morphism conditions restricted so that the bound and renamingparticipating variables avoid X. It is the renamingbased counterpart of the nominal Theorem 2.
In regards to the relative expressiveness of these two recursion principles (Theorems 11 and 2), it seems difficult to find an example that is definable by one but not by the other. In particular, my principle can seamlessly define standard nominal examples [39, 40] such as the length of a term, the counting of \(\lambda \)abstractions or of the freevariables occurrences, and termforvariable substitution—[45, Appendix A] gives details. However, as I am about to discuss, I found an important class of examples where my renamingbased principle is significantly easier to deploy: that of interpreting syntax in semantic domains.
5.3 Extended Example: Semantic Interpretation
Semantic interpretations, also known as denotations (or denotational semantics), are pervasive in the metatheory of logics and \(\lambda \)calculi, for example when interpretating firstorder logic (FOL) formulas in FOL models, or untyped or simplytyped \(\lambda \)calculus or higherorder logic terms in specific models (such as fullframe or Henkin models). In what follows, I will focus on \(\lambda \)terms and Henkin models, but the ideas discussed apply broadly to any kind of statically scoped interpretation of terms or formulas involving binders.
Let D be a set and \({\mathsf {ap}}: D \rightarrow D \rightarrow D\) and \({\mathsf {lm}}: (D \rightarrow D) \rightarrow D\) be operators modeling semantic notions of application and abstraction. An environment will be a function \(\xi : \mathsf {{Var}}\rightarrow D\). Given \(x,y\in \mathsf {{Var}}\) and \(d,e\in D\), let us write \(\xi \langle x:=d\rangle \) for \(\xi \) updated with value d for x (i.e., acting like \(\xi \) on all variables except for x where it returns d); and let us write \(\xi \langle x:=d,y:=e\rangle \) instead of \(\xi \langle x:=d\rangle \langle y:=e\rangle \).
Say one wants to interpret terms in the semantic domain D in the context of environments, i.e., define the function \({\mathsf {sem}}: \mathsf {Trm}\rightarrow (\mathsf {{Var}}\rightarrow D) \rightarrow D\) that maps syntactic to semantic constructs; e.g., one would like to have:

\({\mathsf {sem}}\,(\mathsf {{Lm}}\;x\;(\mathsf {{Ap}}\;x\;x))\;\xi = {\mathsf {lm}}(d \mapsto {\mathsf {ap}}\;d\;d)\) (regardless of \(\xi \))

\({\mathsf {sem}}\,(\mathsf {{Lm}}\;x\;(\mathsf {{Ap}}\;x\;y))\;\xi = {\mathsf {lm}}(d \mapsto {\mathsf {ap}}\;d\;(\xi \;y))\) (assuming \(x\not =y\))
where I use \(d\mapsto \ldots \) to describe functions in \(D\rightarrow D\), e.g., \(d \mapsto {\mathsf {ap}}\;d\;d\) is the function sending every \(d\in D\) to \({\mathsf {ap}}\;d\;d\).
The definition should therefore naturally go recursively by the clauses:
(1) \({\mathsf {sem}}\,(\mathsf {{Vr}}\;x)\,\xi = \xi \;x\) (2) \({\mathsf {sem}}\,(\mathsf {{Ap}}\;t_1\,t_2)\,\xi = {\mathsf {ap}}\,({\mathsf {sem}}\;t_1\,\xi )\,({\mathsf {sem}}\;t_2\,\xi )\)
(3) \({\mathsf {sem}}\,(\mathsf {{Lm}}\;x\;t)\,\xi = {\mathsf {lm}}\,(d \mapsto {\mathsf {sem}}\;t\,(\xi \langle x:= d\rangle ))\)
Of course, since \(\mathsf {Trm}\) is not a free datatype, these clauses do not work out of the box, i.e., do not form a definition (yet)—this is where bindingaware recursion principles such as Theorems 11 and 2 could step in. I will next try them both.
The three clauses above already determine constructor operations \(\mathsf {{Vr}}^\mathcal {I}\), \(\mathsf {{Ap}}^\mathcal {I}\) and \(\mathsf {{Lm}}^\mathcal {I}\) on the set of interpretations, \(I = (\mathsf {{Var}}\rightarrow D) \rightarrow D\), namely:

\(\mathsf {{Vr}}^\mathcal {I}: \mathsf {{Var}}\rightarrow I\) by \(\mathsf {{Vr}}^\mathcal {I}\, x\;i\;\xi = \xi \;x\)

\(\mathsf {{Ap}}^\mathcal {I}: I \rightarrow I \rightarrow I\) by \(\mathsf {{Ap}}^\mathcal {I}\, i_1\,i_2\;\xi = {\mathsf {ap}}\,(i_1\,\xi )\,(i_2\,\xi )\)

\(\mathsf {{Lm}}^\mathcal {I}:\mathsf {{Var}}\rightarrow I \rightarrow I\) by \(\mathsf {{Lm}}^\mathcal {I}\, x\;i\;\xi = {\mathsf {lm}}\,(d \mapsto i\,(\xi \langle x := d\rangle ))\)
To apply the renamingbased recursion principle from Theorem 11, one must further define a renaming operator on I. Since the only chance to successfully apply this principle is if \({\mathsf {sem}}\) commutes with renaming, the definition should be inspired by the question: How can \({\mathsf {sem}}(t[y/x])\) be determined from \({\mathsf {sem}}\;t\), y and x? The answer is (4) \({\mathsf {sem}}\,(t[y / x])\,\xi = ({\mathsf {sem}}\;t)\;(\xi \langle x:= \xi \;y\rangle )\), yielding an operator \([\_/\!\_]^\mathcal {I}: I \rightarrow \mathsf {{Var}}\rightarrow \mathsf {{Var}}\rightarrow I\) defined by \(i\,[y/x]^\mathcal {I}\,\xi = i\,(\xi \langle x:= \xi \;y\rangle )\).
It is not difficult to verify that \(\mathcal {I}= (I,[\_/\!\_]^\mathcal {I},\mathsf {{Vr}}^\mathcal {I},\mathsf {{Ap}}^\mathcal {I},\mathsf {{Lm}}^\mathcal {I})\) is a CE renset—for example, Isabelle’s automatic methods discharge all the goals. This means Theorem 11 (or, since here one doesn’t need Barendregt’s variable convention, already Theorem 8) is applicable, and gives us a unique function \({\mathsf {sem}}\) that commutes with the constructors, i.e., satisfies clauses (1)–(3) (which are instances of the clauses (i)–(iii) from Theorem 11), and additionally commutes with renaming, i.e., satisfies clause (4) (which is an instances of the clause (iv) from Theorem 11).
On the other hand, to apply nominal recursion for defining \({\mathsf {sem}}\), one must identify a swapping operator on I. Similarly to the case of renaming, this identification process is guided by the goal of determining \({\mathsf {sem}}(t[x \wedge y])\) from \({\mathsf {sem}}\;t\), x and y, leading to (4’) \({\mathsf {sem}}\,(t[x \wedge y])\,\xi = {\mathsf {sem}}\;t\;(\xi \langle x:=\xi \;y,y:=\xi \;x\rangle )\), which yields the definition of \([\_\wedge \_]^\mathcal {I}\) by \(i\,[x \wedge y]^\mathcal {I}\,\xi = i\,(\xi \langle x:=\xi \;y,y:=\xi \;x\rangle )\). However, as pointed out by Pitts [39, §6.3] (in the slightly different context of interpreting simplytyped \(\lambda \)calculus), the nominal recursor (Theorem 2) does not directly apply (hence neither does my reformulation based on CE nominal sets, Theorem 10). This is because, in my terminology, the structure \(\mathcal {I}= (I,[\_\wedge \_]^\mathcal {I},\mathsf {{Vr}}^\mathcal {I},\mathsf {{Ap}}^\mathcal {I},\mathsf {{Lm}}^\mathcal {I})\) is not a CE nominal set. The problematic condition is FCB (the freshness condition for binders), requiring that \(x\;\#^\mathcal {I}\, (\mathsf {{Lm}}^\mathcal {I}\,x\;i)\) holds for all \(i\in I\). Expanding the definition of \(\,\#^\mathcal {I}\) (the nominal definition of freshness from swapping, recalled in Sect. 2.2) and the definitions of \([\_\wedge \_]^\mathcal {I}\) and \(\mathsf {{Lm}}^\mathcal {I}\), one can see that \(x\;\#^\mathcal {I}\, (\mathsf {{Lm}}^\mathcal {I}\,x\;i)\) means the following:
\({\mathsf {lm}}\;(d \mapsto i\,(\xi \langle x:=\xi \,y,y:=\xi \,x\rangle \langle x:=d\rangle )) = {\mathsf {lm}}\;(d \mapsto i\,(\xi \langle x:= d\rangle ))\), i.e.,
\({\mathsf {lm}}\;(d \mapsto i\,(\xi \langle x:=d,y:=\xi \,x \rangle ) = {\mathsf {lm}}\;(d \mapsto i\,(\xi \langle x:= d\rangle ))\), holds for all but a finite number of variables y.
The only chance for the above to be true is if i, when applied to an environment, ignores the value of y in that environment for all but a finite number of variables y; in other words, i only analyzes the value of a finite number of variables in that environment—but this is not guaranteed to hold for arbitrary elements \(i\in I\). To repair this, Pitts engages in a form of inductionrecursion [17], carving out from I a smaller domain that is still large enough to interpret all terms, then proving that both FCB and the other axioms hold for this restricted domain. It all works out in the end, but the technicalities are quite involved.
Although FCB is not required by the renamingbased principle, note incidentally that this condition would actually be true (and immediate to check) if working with freshness defined not from swapping but from renaming. Indeed, the renamingbased version of \(x \;\#^\mathcal {I}\, (\mathsf {{Lm}}^\mathcal {I}\,x\;i)\) says that \({\mathsf {lm}}\;(d \mapsto i\,(\xi \langle x:=\xi \,y\rangle \langle x:=d\rangle )) = {\mathsf {lm}}\;(d \mapsto i\,(\xi \langle x:= d\rangle ))\) holds for all y (or at least for some \(y\not =x\))—which is immediate since \(\xi \langle x:=\xi \,y\rangle \langle x:=d\rangle = \xi \langle x:=d\rangle \). This further illustrates the idea that semantic domains ‘favor’ renaming over swapping.
In conclusion, for interpreting syntax in semantic domains, my renamingbased recursor is trivial to apply, whereas the nominal recursor requires some fairly involved additional definitions and proofs.
6 Conclusion and Related Work
This paper introduced and studied rensets, contributing (1) theoretically, a minimalistic equational characterization of the datatype of terms with bindings and (2) practically, an addition to the formal arsenal for manipulating syntax with bindings. It is part of a longstanding line of work by myself and collaborators on exploring convenient definition and reasoning principles for bindings [25, 27, 43, 46, 47], and will be incorporated into the ongoing implementation of a new Isabelle definitional package for bindingaware datatypes [12].
Initial Model Characterizations of the Terms Datatype. My results provide a truly elementary characterization of terms with bindings, as an “ordinary” datatype specified by the fundamental operations only (the constructors plus variableforvariable renaming) and some equations (those defining CE rensets). As far as specification simplicity goes, this is “the next best thing” after a completely free datatype such as those of natural numbers or lists.
Figure 1 shows previous characterizations from the literature, in which terms with bindings are identified as an initial model (or algebra) of some kind. For each of these, I indicate (1) the employed reasoning paradigm, (2) whether the initiality/recursion theorem features an extension with Barendregt’s variable convention, (3) the underlying category (from where the carriers of the models are taken), (4) the operations and relations on terms to which the models must provide counterparts and (5) the properties required on the models.
While some of these results enjoy elegant mathematical properties of intrinsic value, my main interest is in the recursors they enable, specifically in the ease of deploying these recursors. That is, I am interested in how easy it is in principle to organize the target domain as a model of the requested type, hence obtain the desired morphism, i.e., get the recursive definition done. By this measure, elementary approaches relying on standard FOLlike models whose carriers are sets rather than presheaves have an advantage. Also, it seems intuitive that a recursor is easier to apply if there are fewer operators, and fewer and structurally simpler properties required on its models—although empirical evidence of successfully deploying the recursor in practice should complement the simplicity assessment, to ensure that simplicity is not sponsored by lack of expressiveness.
The first column in Fig. 1’s table contains an influential representative of the nameless paradigm: the result obtained independently by Fiore et al. [22] and Hofmann [29] characterizing terms as initial in the category of algebras over the presheaf topos \( Set ^{\mathbb {F}}\), where \({\mathbb {F}}\) is the category of finite ordinals and functions between them. The operators required by algebras are the constructors, as well as the freevariable operator (implicitly as part of the separation on levels) and the injective renamings (as part of the functorial structure). The algebra’s carrier is required to be a functor and the constructors to be natural transformations. There are several variations of this approach, e.g., [5, 11, 29], some implemented in proof assistants, e.g., [3, 4, 31].
The other columns refer to initiality results that are more closely related to mine. They take place within the nameful paradigm, and they all rely on elementary models (with set carriers). Pitts’s already discussed nominal recursor [39] (based on previous work by Gabbay and Pitts [23]) employs the constructors and permutation (or swapping), and requires that its models satisfy some Horn clauses for constructors, permutation and freshness, together with the secondorder properties that (1) define freshness from swapping and (2) express Finite Support. Urban et al.’s version [56, 57] implemented in Isabelle/Nominal is an improvement of Pitts’s in that it removes the Finite Support requirement from the models—which is practically significant because it enables nonfinitely supported target domains for recursion. Norrish’s result [33] is explicitly inspired by nominal logic, but renounces the definability of the freevariable operator from swapping—with the price of taking both swapping and freevariables as primitives. My previous work with Gunter and Gheri takes as primitives either termforvariable substitution and freshness [46] or swapping and freshness [25], and requires properties expressed by different Horn clauses (and does not explore a Barendregt dimension, like Pitts, Urban et al. and Norrish do). My previous focus on termforvariable substitution [46] (as opposed to renaming, i.e., variableforvariable substitution) impairs expressiveness—for example, the depth of a term is not definable using a recursor based on termforvariable substitution because we cannot say how termforvariable substitution affects the depth of a term based on its depth and that of the substitutee alone. My current result based on rensets keeps freshness out of the primitive operators base (like nominal logic does), and provides an unconditionally equational characterization using only constructors and renaming. The key to achieving this minimality is the simple expression of freshness from renaming in my axiomatization of rensets. In future work, I plan a systematic formal comparison of the relative expressiveness of all these nameful recursors.
Recursors in Other Paradigms. Figure 1 focuses on nameful recursors, while only the Fiore et al./Hofmann recursor for the sake of a rough comparison with the nameless approach. I should stress that such a comparison is necessarily rough, since the nameless recursors do not give the same “payload” as the nameful ones. This is because of the handling of bound variables. In the nameless paradigm, the \(\lambda \)constructor does not explicitly take a variable as an input, as in \(\mathsf {{Lm}}\;x\;t\), i.e., does not have type \(\mathsf {{Var}}\rightarrow \mathsf {Trm}\rightarrow \mathsf {Trm}\). Instead, the bindings are indicated through nameless pointers to positions in a term. So the nameless \(\lambda \)constructor, let’s call it \(\mathsf {{NLm}}\), takes only a term, as in \(\mathsf {{NLm}}\;t\), i.e., has type \(\mathsf {Trm}\rightarrow \mathsf {Trm}\) or a scopesafe (polymorphic or dependentlytyped) variation of this, e.g., \(\prod _{n \in \mathbb {F}} \mathsf {Trm}_n \rightarrow \mathsf {Trm}_{n+1}\) [22, 29] or \(\prod _{\alpha \in \mathsf {{Type}}} \mathsf {Trm}_\alpha \rightarrow \mathsf {Trm}_{\alpha + \textsf {unit}}\) [5, 11]. The \(\lambda \)constructor is of course matched by operators in the considered models, which appears in the clauses of the functions f defined recursively on terms: Instead of a clause of the form \(f\;(\mathsf {{Lm}}\;x\;t) \,=\, \langle \text{ expression } \text{ depending } \text{ on } x{ and}f\,t\rangle \) from the nameful paradigm, in the nameless paradigm one gets a clause of the form \( f\;(\mathsf {{NLm}}\;t) \,=\, \langle \text{ expression } \text{ depending } \text{ on } f\,t\rangle \). A nameless recursor is usually easier to prove correct and easier to apply because the nameless constructor \(\mathsf {{NLm}}\) is free—whereas a nameful recursor must wrestle with the nonfreeness of \(\mathsf {{Lm}}\), handled by verifying certain properties of the target models. However, once the definition is done, having nameful clauses pays off by allowing “textbookstyle” proofs that stay close to the informal presentation of a calculus or logic, whereas with the nameless definition some additional index shifting bureaucracy is necessary. (See [9] for a detailed discussion, and [14] for a hybrid solution.)
A comparison of nameful recursion with HOAS recursion is also generally difficult, since major HOAS frameworks such as Abella [7], Beluga [37] or Twelf [36] are developed within nonstandard logical foundations, allowing a \(\lambda \)constructor of type \((\mathsf {Trm}\rightarrow \mathsf {Trm}) \rightarrow \mathsf {Trm}\), which is not amenable to typical wellfoundedness based recursion but requires some custom solutions (e.g., [21, 50]). However, the weak HOAS variant [16, 27] employs a constructor of the form \(\mathsf {{WHLm}}: (\mathsf {{Var}}\rightarrow \mathsf {Trm}) \rightarrow \mathsf {Trm}\) which is recursable, and in fact yields a free datatype, let us call it \(\mathsf {WHTrm}\)—one generated by \(\mathsf {{WHVr}}: \mathsf {{Var}}\rightarrow \mathsf {WHTrm}\), \(\mathsf {{WHAp}}: \mathsf {WHTrm}\rightarrow \mathsf {WHTrm}\rightarrow \mathsf {WHTrm}\) and \(\mathsf {{WHLm}}\). \(\mathsf {WHTrm}\) contains (natural encodings of) all terms but also additional entities referred to as “exotic terms”. Partly because of the exotic terms, this free datatype by itself is not very helpful for recursively defining useful functions on terms. But the situation is dramatically improved if one employs a variant of weak HOAS called parametric HOAS (PHOAS) [15], i.e., takes \(\mathsf {{Var}}\) not as a fixed type but as a type parameter (type variable) and works with \(\prod _{\mathsf {{Var}}\in \mathsf {{Type}}} \mathsf {Trm}_\mathsf {{Var}}\); this enables many useful definitions by choosing a suitable type \(\mathsf {{Var}}\) (usually large enough to make the necessary distinctions) and then performing standard recursion. The functions definable in the style of PHOAS seem to be exactly those definable via the semantic domain interpretation pattern (Sect. 5.3): Choosing the instantiation of \(\mathsf {{Var}}\) to a type T corresponds to employing environments in \(\mathsf {{Var}}\rightarrow T\). (I illustrate this at the end of [45, Appendix A] by showing the semanticdomain version of a PHOAS example.)
As a hybrid nameful/HOAS approach we can count Gordon and Melham’s characterization of the datatype of terms [26], which employs the nameful constructors but formulates recursion treating \(\mathsf {{Lm}}\) as if recursing in the weakHOAS datatype \(\mathsf {WHTrm}\). Norrish’s recursor [33] (a participant in Fig. 1) has been inferred from Gordon and Melham’s one. WeakHOAS recursion also has interesting connections with nameless recursion: In presheaf toposes such as those employed by Fiore et al. [22], Hofmann [29] and Ambler et al. [6], for any object T the function space \(\mathsf {{Var}}\Rightarrow T\) is isomorphic to the De Bruijn level shifting transformation applied to T; this effectively equates the weakHOAS and nameless recursors. A final crossparadigm note: In themselves, nominal sets are not confined to the nameful paradigm; their category is equivalent [23] to the Schanuel topos [30], which is attractive for pursuing the nameless approach.
Axiomatizations of Renaming. In his study of namepassing process calculi, Staton [52] considers an enrichment of nominal sets with renaming (in addition to swapping) and axiomatizes renaming with the help of the nominal (swappingdefined) freshness predicate. He shows that the resulted category is equivalent to the noninjective renaming counterpart of the Schanuel topos (i.e., the subcategory of \( Set ^{\mathbb {F}}\) consisting of functors that preserve pullbacks of monos). Gabbay and Hofmann [24] provide an elementary characterization of the above category, in terms of nominal renaming sets, which are sets equipped with a multiplevariablerenaming action satisfying identity and composition laws, and a form of Finite Support (FS). Nominal renaming sets seem very related to rensets satisfying FS. Indeed, any nominal renaming set forms a FSsatisfying renset when restricted to singlevariable renaming. Conversely, I conjecture that any FSsatisfying renset gives rise to a nominal renaming set. This correspondence seems similar to the one between the permutationbased and swappingbased alternative axiomatizations of nominal sets—in that the two express the same concept up to an isomorphism of categories. In their paper, Gabbay and Hofmann do not study renamingbased recursion, beyond noting the availability of a recursor stemming from the functorcategory view (which, as I discussed above, enables nameless recursion with a weakHOAS flavor). Pitts [41] introduces nominal sets with 01substitution structure, which axiomatize substitution of one of two possible constants for variables on top of the nominal axiomatization, and proves that they form a category that is equivalent with that of cubical sets [10], hence relevant for the univalent foundations [54].
Other Work. Sun [53] develops universal algebra for firstorder languages with bindings (generalizing work by Aczel [2]) and proves a completeness theorem. In joint work with Roşu [48], I develop firstorder logic and prove completeness on top of a generic syntax with axiomatized freevariables and substitution.
Renaming Versus Swapping and Nominal Logic, Final Round. I believe that my work complements rather than competes with nominal logic. My results do not challenge the swappingbased approach to defining syntax (defining the alphaequivalence on preterms and quotienting to obtain terms) recommended by nominal logic, which is more elegant than a renamingbased alternative; but my easiertoapply recursor can be a useful addition even on top of the nominal substratum. Moreover, some of my constructions are explicitly inspired by the nominal ones. For example, I started by adapting the nominal idea of defining freshness from swapping before noticing that renaming enables a simpler formulation. My formal treatment of Barendregt’s variable convention also originates from nominal logic—as it turns out, this idea works equally well in my setting. In fact, I came to believe that the possibility of a Barendregt enhancement is largely orthogonal to the particularities of a bindingaware recursor. In future work, I plan to investigate this, i.e., seek general conditions under which an initiality principle (such as Theorems 10 and 8) is amenable to a Barendregt enhancement (such as Theorems 2 and 11, respectively).
References
Abel, A., et al.: Poplmark reloaded: mechanizing proofs by logical relations. J. Funct. Program. 29, e19 (2019). https://doi.org/10.1017/S0956796819000170
Aczel, P.: Frege structures and notations in propositions, truth and set. In: The Kleene Symposium, pp. 31–59. North Holland (1980)
Allais, G., Atkey, R., Chapman, J., McBride, C., McKinna, J.: A type and scope safe universe of syntaxes with binding: their semantics and proofs. Proc. ACM Program. Lang. 2(International Conference on Functional Programming (ICFP)), 90:1–90:30 (2018). https://doi.acm.org/10.1145/3236785
Allais, G., Chapman, J., McBride, C., McKinna, J.: Typeandscope safe programs and their proofs. In: Bertot, Y., Vafeiadis, V. (eds.) Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, CPP 2017, Paris, France, 16–17 January 2017, pp. 195–207. ACM (2017). https://doi.org/10.1145/3018610.3018613
Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: Flum, J., RodriguezArtalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 453–468. Springer, Heidelberg (1999). https://doi.org/10.1007/3540481680_32
Ambler, S.J., Crole, R.L., Momigliano, A.: A definitional approach to primitivexs recursion over higher order abstract syntax. In: Eighth ACM SIGPLAN International Conference on Functional Programming, Workshop on Mechanized Reasoning About Languages with Variable Binding, MERLIN 2003, Uppsala, Sweden, August 2003. ACM (2003). https://doi.org/10.1145/976571.976572
Baelde, D., et al.: Abella: a system for reasoning about relational specifications. J. Formaliz. Reason. 7(2), 1–89 (2014). https://doi.org/10.6092/issn.19725787/4650
Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics, Studies in Logic, vol. 40. Elsevier (1984)
Berghofer, S., Urban, C.: A headtohead comparison of de Bruijn indices and names. Electr. Notes Theor. Comput. Sci. 174(5), 53–67 (2007). https://doi.org/10.1016/j.entcs.2007.01.018
Bezem, M., Coquand, T., Huber, S.: A model of type theory in cubical sets. In: Matthes, R., Schubert, A. (eds.) 19th International Conference on Types for Proofs and Programs, TYPES 2013, 22–26 April 2013, Toulouse, France. LIPIcs, vol. 26, pp. 107–128. Schloss Dagstuhl  LeibnizZentrum für Informatik (2013). https://doi.org/10.4230/LIPIcs.TYPES.2013.107
Bird, R.S., Paterson, R.: De Bruijn notation as a nested datatype. J. Funct. Program. 9(1), 77–91 (1999). https://doi.org/10.1017/S0956796899003366
Blanchette, J.C., Gheri, L., Popescu, A., Traytel, D.: Bindings as bounded natural functors. Proc. ACM Program. Lang. 3(POPL), 22:1–22:34 (2019). https://doi.org/10.1145/3290335
de Bruijn, N.G.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the ChurchRosser theorem. Indag. Math. 75(5), 381–392 (1972). https://doi.org/10.1016/13857258(72)900340
Charguéraud, A.: The locally nameless representation. J. Autom. Reason. 49(3), 363–408 (2012). https://doi.org/10.1007/s1081701192252
Chlipala, A.: Parametric higherorder abstract syntax for mechanized semantics. In: Hook, J., Thiemann, P. (eds.) International Conference on Functional Programming (ICFP) 2008, pp. 143–156. ACM (2008). https://doi.org/10.1145/1411204.1411226
Despeyroux, J., Felty, A., Hirschowitz, A.: Higherorder abstract syntax in Coq. In: DezaniCiancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol. 902, pp. 124–138. Springer, Heidelberg (1995). https://doi.org/10.1007/BFb0014049
Dybjer, P.: A general formulation of simultaneous inductiverecursive definitions in type theory. J. Symb. Log. 65(2), 525–549 (2000). https://doi.org/10.2307/2586554
Felty, A.P., Momigliano, A.: Hybrid: a definitional twolevel approach to reasoning with higherorder abstract syntax. J. Autom. Reason. 48(1), 43–105 (2012). https://doi.org/10.1007/s108170109194x
Felty, A.P., Momigliano, A., Pientka, B.: The next 700 challenge problems for reasoning with higherorder abstract syntax representations  part 2  a survey. J. Autom. Reason. 55(4), 307–372 (2015). https://doi.org/10.1007/s1081701593273
Felty, A.P., Momigliano, A., Pientka, B.: An open challenge problem repository for systems supporting binders. In: Cervesato, I., Chaudhuri, K. (eds.) Proceedings Tenth International Workshop on Logical Frameworks and Meta Languages: Theory and Practice, LFMTP 2015, Berlin, Germany, 1 August 2015. EPTCS, vol. 185, pp. 18–32 (2015). https://doi.org/10.4204/EPTCS.185.2
Ferreira, F., Pientka, B.: Programs using syntax with firstclass binders. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 504–529. Springer, Heidelberg (2017). https://doi.org/10.1007/9783662544341_19
Fiore, M.P., Plotkin, G.D., Turi, D.: Abstract syntax and variable binding. In: Logic in Computer Science (LICS) 1999, pp. 193–202. IEEE Computer Society (1999). https://doi.org/10.1109/LICS.1999.782615
Gabbay, M., Pitts, A.M.: A new approach to abstract syntax involving binders. In: Logic in Computer Science (LICS) 1999, pp. 214–224. IEEE Computer Society (1999). https://doi.org/10.1109/LICS.1999.782617
Gabbay, M.J., Hofmann, M.: Nominal renaming sets. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 158–173. Springer, Heidelberg (2008). https://doi.org/10.1007/9783540894391_11
Gheri, L., Popescu, A.: A formalized general theory of syntax with bindings: extended version. J. Autom. Reason. 64(4), 641–675 (2020). https://doi.org/10.1007/s10817019095222
Gordon, A.D., Melham, T.: Five axioms of alphaconversion. In: Goos, G., Hartmanis, J., van Leeuwen, J., von Wright, J., Grundy, J., Harrison, J. (eds.) TPHOLs 1996. LNCS, vol. 1125, pp. 173–190. Springer, Heidelberg (1996). https://doi.org/10.1007/BFb0105404
Gunter, E.L., Osborn, C.J., Popescu, A.: Theory support for weak higher order abstract syntax in Isabelle/HOL. In: Cheney, J., Felty, A.P. (eds.) Logical Frameworks and MetaLanguages: Theory and Practice (LFMTP) 2009, pp. 12–20. ACM (2009). https://doi.org/10.1145/1577824.1577827
Harper, R., Honsell, F., Plotkin, G.D.: A framework for defining logics. In: Logic in Computer Science (LICS) 1987, pp. 194–204. IEEE Computer Society (1987). https://doi.org/10.1145/138027.138060
Hofmann, M.: Semantical analysis of higherorder abstract syntax. In: Logic in Computer Science (LICS) 1999, pp. 204–213. IEEE Computer Society (1999). https://doi.org/10.1109/LICS.1999.782616
Johnstone, P.T.: Quotients of decidable objects in a topos. Math. Proc. Camb. Philos. Soc. 93, 409–419 (1983). https://doi.org/10.1017/S0305004100060734
Kaiser, J., Schäfer, S., Stark, K.: Binder aware recursion over wellscoped de bruijn syntax. In: Andronick, J., Felty, A.P. (eds.) Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Los Angeles, CA, USA, 8–9 January 2018, pp. 293–306. ACM (2018). https://doi.org/10.1145/3167098
Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle/HOL—A Proof Assistant for HigherOrder Logic. LNCS, vol. 2283. Springer, Heidelberg (2002). https://doi.org/10.1007/3540459499
Norrish, M.: Recursive function definition for types with binders. In: Slind, K., Bunker, A., Gopalakrishnan, G. (eds.) TPHOLs 2004. LNCS, vol. 3223, pp. 241–256. Springer, Heidelberg (2004). https://doi.org/10.1007/9783540301424_18
Paulson, L.C.: The foundation of a generic theorem prover. J. Autom. Reason. 5(3), 363–397 (1989). https://doi.org/10.1007/BF00248324
Pfenning, F., Elliott, C.: Higherorder abstract syntax. In: Wexelblat, R.L. (ed.) Programming Language Design and Implementation (PLDI) 1988, pp. 199–208. ACM (1988). https://doi.org/10.1145/53990.54010
Pfenning, F., Schürmann, C.: System description: twelf — a metalogical framework for deductive systems. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 202–206. Springer, Heidelberg (1999). https://doi.org/10.1007/3540486607_14
Pientka, B.: Beluga: programming with dependent types, contextual data, and contexts. In: Blume, M., Kobayashi, N., Vidal, G. (eds.) FLOPS 2010. LNCS, vol. 6009, pp. 1–12. Springer, Heidelberg (2010). https://doi.org/10.1007/9783642122514_1
Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput. 186(2), 165–193 (2003). https://doi.org/10.1016/S08905401(03)00138X
Pitts, A.M.: Alphastructural recursion and induction. J. ACM 53(3), 459–506 (2006). https://doi.org/10.1145/1147954.1147961
Pitts, A.M.: Nominal Sets: Names and Symmetry in Computer Science. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2013)
Pitts, A.M.: Nominal presentation of cubical sets models of type theory. In: Herbelin, H., Letouzey, P., Sozeau, M. (eds.) 20th International Conference on Types for Proofs and Programs (TYPES 2014). Leibniz International Proceedings in Informatics (LIPIcs), vol. 39, pp. 202–220. Schloss DagstuhlLeibnizZentrum fuer Informatik, Dagstuhl, Germany (2015). http://drops.dagstuhl.de/opus/volltexte/2015/5498
Pollack, R., Sato, M., Ricciotti, W.: A canonical locally named representation of binding. J. Autom. Reason. 49(2), 185–207 (2012). https://doi.org/10.1007/s108170119229y
Popescu, A.: Contributions to the theory of syntax with bindings and to process algebra. Ph.D. thesis, University of Illinois at UrbanaChampaign (2010). https://www.andreipopescu.uk/pdf/thesisUIUC.pdf
Popescu, A.: RenamingEnriched Sets. Arch. Formal Proofs 2022 (2022). https://www.isaafp.org/entries/Renaming_Enriched_Sets.html
Popescu, A.: Rensets and renamingbased recursion for syntax with bindings. arXiv (2022). https://arxiv.org/abs/2205.09233
Popescu, A., Gunter, E.L.: Recursion principles for syntax with bindings and substitution. In: Chakravarty, M.M.T., Hu, Z., Danvy, O. (eds.) Proceeding of the 16th ACM SIGPLAN International Conference on Functional Programming, ICFP 2011, Tokyo, Japan, 19–21 September 2011, pp. 346–358. ACM (2011). https://doi.org/10.1145/2034773.2034819
Popescu, A., Gunter, E.L., Osborn, C.J.: Strong normalization for system F by HOAS on top of FOAS. In: Logic in Computer Science (LICS) 2010, pp. 31–40. IEEE Computer Society (2010). https://doi.org/10.1109/LICS.2010.48
Popescu, A., Roşu, G.: Termgeneric logic. Theor. Comput. Sci. 577, 1–24 (2015)
Schäfer, S., Tebbi, T., Smolka, G.: Autosubst: reasoning with de Bruijn terms and parallel substitutions. In: Urban, C., Zhang, X. (eds.) ITP 2015. LNCS, vol. 9236, pp. 359–374. Springer, Cham (2015). https://doi.org/10.1007/9783319221021_24
Schürmann, C., Despeyroux, J., Pfenning, F.: Primitive recursion for higherorder abstract syntax. Theor. Comput. Sci. 266(1–2), 1–57 (2001). https://doi.org/10.1016/S03043975(00)004187
Stark, K.: Mechanising syntax with binders in Coq. Ph.D. thesis, Saarland University, Saarbrücken, Germany (2020). https://publikationen.sulb.unisaarland.de/handle/20.500.11880/28822
Staton, S.: Namepassing process calculi: operational models and structural operational semantics. Technical report, UCAMCLTR688, University of Cambridge, Computer Laboratory (2007). https://www.cl.cam.ac.uk/techreports/UCAMCLTR688.pdf
Sun, Y.: An algebraic generalization of Frege structures–binding algebras. Theor. Comput. Sci. 211(1–2), 189–232 (1999)
The Univalent Foundations Program: Homotopy Type Theory. Univalent Foundations of Mathematics. Institute for Advanced Study (2013). https://homotopytypetheory.org/book
Traytel, D., Popescu, A., Blanchette, J.C.: Foundational, compositional (co)datatypes for higherorder logic: category theory applied to theorem proving. In: Logic in Computer Science (LICS) 2012, pp. 596–605. IEEE Computer Society (2012). https://doi.org/10.1109/LICS.2012.75
Urban, C.: Nominal techniques in Isabelle/HOL. J. Autom. Reason. 40(4), 327–356 (2008). https://doi.org/10.1007/s1081700890972
Urban, C., Berghofer, S.: A recursion combinator for nominal datatypes implemented in Isabelle/HOL. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 498–512. Springer, Heidelberg (2006). https://doi.org/10.1007/11814771_41
Urban, C., Berghofer, S., Norrish, M.: Barendregt’s variable convention in rule inductions. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 35–50. Springer, Heidelberg (2007). https://doi.org/10.1007/9783540735953_4
Urban, C., Kaliszyk, C.: General bindings and alphaequivalence in Nominal Isabelle. Log. Methods Comput. Sci. 8(2) (2012). https://doi.org/10.2168/LMCS8(2:14)2012
Urban, C., Tasson, C.: Nominal techniques in Isabelle/HOL. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 38–53. Springer, Heidelberg (2005). https://doi.org/10.1007/11532231_4
Acknowledgments
I am grateful to the IJCAR reviewers for their insightful comments and suggestions, and for pointing out related work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2022 The Author(s)
About this paper
Cite this paper
Popescu, A. (2022). Rensets and RenamingBased Recursion for Syntax with Bindings. In: Blanchette, J., Kovács, L., Pattinson, D. (eds) Automated Reasoning. IJCAR 2022. Lecture Notes in Computer Science(), vol 13385. Springer, Cham. https://doi.org/10.1007/9783031107696_36
Download citation
DOI: https://doi.org/10.1007/9783031107696_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 9783031107689
Online ISBN: 9783031107696
eBook Packages: Computer ScienceComputer Science (R0)