In this article, authors talk about the relevance of the training of foreign students in verbal-nominal combinations in different spheres of functioning. It is important for language adaptation. Language adaptation depends on how students know the system of language and the feature of language expression of sense. Verbal-nominal combinations are used in different spheres therefore they can be s...

Model Predictive Control is a controller design method which synthesizes a sampled data feedback controller from the iterative solution of open loop optimal control problems. We describe the basic functionality of MPC controllers, their properties regarding feasibility, stability and performance and the assumptions needed in order to rigorously ensure these properties in a nominal setting.

We employ automata over infinite alphabets to capture the semantics of a finitary fragment of ML with ground-type references. Our approach is founded on game semantics, which allows us to translate programs into automata in such a way that contextual equivalence is characterized by a finitary notion of bisimilarity. As a corollary, we derive a decidability result for a class of first-order prog...

Nominal unification is an extension of first-order unification that takes into account the α-equivalence relation generated by binding operators, following the nominal approach. We propose a sound and complete procedure for nominal unification with commutative operators, or nominal C-unification for short, which has been formalised in Coq. The procedure transforms nominal C-unification problems...

Since the discovery of fully abstract models of PCF in the early 1990s, game semantics has expanded to a wide range of programming paradigms, covering effects like state, control, general references, non-determinism, probability and concurrency. Those models revealed an interesting phenomenon referred to as Abramsky’s cube: starting from the PCF model and relaxing each of its combinatorial cond...

Nominal rewriting is a framework of higher-order rewriting introduced in (Fernández, Gabbay & Mackie, 2004; Fernández & Gabbay, 2007). Recently, (Suzuki et al., 2015) revisited confluence of nominal rewriting in the light of feasibility. We report on an implementation of a confluence tool for (non-closed) nominal rewriting, based on (Suzuki et al., 2015) and succeeding studies.

These tutorial notes present nominal game semantics, a denotational technique for modelling higher-order programs. A. S. Murawski and N. Tzevelekos. Nominal Game Semantics. Foundations and TrendsR © in Programming Languages, vol. 2, no. 4, pp. 191–269, 2015. DOI: 10.1561/2500000017.

Nominal unification calculates substitutions that make terms involving binders equal modulo alphaequivalence. Although nominal unification can be seen as equivalent to Miller’s higher-order pattern unification, it has properties, such as the use of first-order terms with names (as opposed to alphaequivalence classes) and that no new names need to be generated during unification, which set it cl...

Equation solving between nominal terms has been investigated by several authors, who designed and analyzed algorithms for nominal unification [3, 4, 15, 26], nominal matching [5], equivariant unification [6], permissive nominal unification [8]. However, in contrast to unification, its dual problem, anti-unification, has not been studied for nominal terms previously. In [18], it is referred to a...