Nominal memoization combines memoized functional programming with a controlled form of imperative cache effects. By leveraging these imperative effects, nominal memoization can dramatically outperform traditional (“structural”) memoization. However, the nominal memoization programming model is error-prone: when the programmer unintentionally misuses names, their incremental program ceases to co...

In this extended abstract, we review our recent work “Nominal Schemas in Description Logics: Complexities Clarified” [6], to be presented at KR 2014. The fruitful integration of reasoning on both schema and instance level poses a continued challenge to knowledge representation and reasoning. While description logics (DLs) excel at the former task, rule-based formalisms are often more adequate f...

Nominal memoization combines memoized functional programming with a controlled form of imperative cache effects. By leveraging these imperative effects, nominal memoization can dramatically outperform traditional (“structural”) memoization. However, the nominal memoization programming model is error-prone: when the programmer unintentionally misuses names, their incremental program ceases to co...

This paper concerns grammatical phenomena sensitive to certain classes of nominal forms, i.e. those that encode different kinds of referential properties of the nominal. We propose a grammar component for defining and picking out such semantic classes of nominal forms within typed feature structure formalisms such as the one used in HPSG, thus aiming at standardizing the representation of such ...

A semi-empirical impedance model based on a single parameter (effective flow resistivity) for the characteristic impedance of fibrous materials has proved remarkably successful for predicting outdoor ground effects. This model allows for the effects associated with the porosity of the ground. Surface roughness with scales much smaller than the incident wavelengths influences reflection from har...

We use nominal sets (sets with names and binding) to define a framework for trace semantics with dynamic allocation of resources. Using novel constructions in nominal sets, including the technical devices of positive nominal sets and maximal planes, we define notions of captureavoiding composition and name-restriction on sets of traces with names. We conclude with an extended version of Kleene ...

In nominal syntax, variable binding is specified using atomabstraction constructors, and alpha-equivalence is formalised using fresh-ion constructors, and alpha-equivalence is formalised using freshness constraints and atom swappings, which implement variable renamings. Composition of swappings gives rise to atom permutations. Algorithms to check equivalence, match and unify nominal terms have ...

We propose Equivariant ZFA with Choice as a foundation for nominal techniques that is stronger than ZFC and weaker than FM, and why this may be particularly helpful in the context of automated reasoning.

In this paper application of a simulation algorithm for dynamic and nonlinear analysis of a specific liquid propellant engine is presented. The mathematical model of the engine includes a set of nonlinear algebraic equations which is coupled with a set of time varying differential equations. In contrast to the existing liquid propellant simulation algorithms, the presented work does not depend ...