Maribel Fernández

Learn More
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(More)
Interaction nets are graphical rewriting systems which can be used as either a high-level programming paradigm or a low-level implementation language. However, an operational semantics together with notions of strategy and normal form which are essential to reason about implementations, are not easy to formalize in this graphical framework. The purpose of(More)
Nominal rewriting extends first-order rewriting with Gabbay-Pitts abstractors: bound entities are named, matching respects α-conversion and can be directly implemented thanks to the use of freshness constraints. In this paper we study two extensions to nominal rewriting. First we introduce a NEW quantifier for modelling name generation and restriction.(More)
In large, and often distributed, environments, where access control information may be shared across multiple sites, the combination of individual specifications in order to define a coherent access control policy is of fundamental importance. In order to ensure non-ambiguous behaviour, formal languages, often relying on firstorder logic, have been(More)