Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such descriptions: the interpretation of atomic judgments through recursive definitions and an encoding of binding constructs via generic judgments. However, logics encompa...

Nominal rewriting is based on the observation that if we add support for alphaequivalence to first-order syntax using the nominal-set approach, then systems with binding, including higher-order features such as lambda-calculus beta-reduction, can be smoothly represented. Nominal rewriting maintains a strict distinction between variables of the objectlanguage (atoms) and of the meta-language (va...

We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete procedure to check nominal algebra equality. This subclass includes specifications of lambda-calculus and first-order ...

previous research has identified the nominal group as the most distinctive feature of the research article title. in contrast, the findings reported in this paper suggest theme/rheme is the dominant structure in title text. theme/rheme structures order and tie nominal groups in titles. when a title starts with a methodological term the first position nominal group acts as a theme marker. thus, ...

This article offers a characterization of what I call multiple-models juxtaposition (MMJ), strategy for managing trade-offs among modeling desiderata. MMJ displays models distinct phenomena together and fulfills different desiderata both in the individual by comparison those models. discuss concrete case from developmental biology, where coordinates generality detail. also clarify distinction b...

We present a generalisation of first-order unification to the practically important case of equations between terms involving binding operations. A substitution of terms for variables solves such an equation if it makes the equated terms α-equivalent, i.e. equal up to renaming bound names. For the applications we have in mind, we must consider the simple, textual form of substitution in which n...

We investigate different notions of nominal words, that is, words that my contain letters from an alphabet as well as names and name-binders. In a first section we construct them from first principles. In a second section we take the point of view that—as in the classical case—words over an alphabet S form a free monoid over S. We define different notions of nominal monoids and reveal nominal w...