We present a simplified version of nominal terms with improved properties. Nominal terms are themselves a version of first-order terms, adapted to provide primitive support for names, binding, capturing substitution, and alpha-conversion. Nominal terms lack certain properties of first-order terms; it is always possible to ‘choose a fresh variable symbol’ for a first-order term and it is always ...

We present a formal correspondence between Laird’s trace semantics and the nominal game model of Murawski and Tzevelekos for RefML, a callby-value language with higher-order references. This gives an operational flavor to game semantics, where denotation of terms is generated via an interactive reduction, which allows to reduce terms with free functional variables, and where pointer structure i...

In this paper we have described the construction of a graded naming test that makes the distinction between object and proper names. This distinction was prompted by a single case study of a patient who showed a specific naming impairment for a particular class of proper names. Naming vocabulary was found to be highly correlated with other measures of verbal intelligence and we have discussed t...

This thesis investigates and proposes models for programming and verifying adaptive software at different abstraction levels. First, we design the kernel of a programming language, endowed with primitives for programming the adaptation to different working environments. We provide the language with a type and effect system that allows us to statically prove properties of the behaviour of the pr...

We develop the coalgebraic theory of nominal Kleene algebra, including an alternative language-theoretic semantics, a nominal extension of the Brzozowski derivative, and a bisimulation-based decision procedure for the equational theory.

Recently, a very general description logic (DL) that extends SROIQ (the DL underlying OWL 2 DL) at the same time with nominal schemas and epistemic modal operators has been proposed, which encompasses some of the most prominent monotonic and non-monotonic rule languages, including Datalog under the answer set semantics. A decidable fragment is also presented, but the restricted language does no...

This paper proposes a method of identi cation for a discrete-time state-space model set presuming the existence of robust performance control. The model set is described by a nominal model and a parametric uncertainty bound measured with the Frobenius norm. The identi cation problem considered in this paper is to nd a model set which satis es conditions: (i) the model set is consistent with giv...