Nominal renaming sets ( technical report )
نویسنده
چکیده
Nominal techniques are based on the idea of sets with a finitelysupported atoms-permutation action. In this paper we consider the idea of sets with a finitely-supported atoms-renaming action (renamings can identify atoms; permutations cannot). We show that these exhibit many of the useful qualities found in traditional nominal techniques; an elementary sets-based presentation, inductive datatypes of syntax up to binding, cartesian closure, and being a topos. Unlike in nominal techniques, the notion of names-abstraction coincides with functional abstraction.
منابع مشابه
Toward Model Theory with Data Values
We define a variant of first-order logic that deals with data words, data trees, data graphs etc. The definition of the logic is based on Fraenkel-Mostowski sets (FM sets, also known as nominal sets). The key idea is that we allow infinite disjunction (and conjunction), as long as the set of disjuncts (conjunct) is finite modulo renaming of data values. We study model theory for this logic; in ...
متن کاملNominal Logic: A First Order Theory of Names and Binding
This paper formalises within first-order logic some common practices in computer science to do with representing and reasoning about syntactical structures involving lexically scoped binding constructs. It introduces Nominal Logic, a version of first-order many-sorted logic with equality containing primitives for renaming via name-swapping, for freshness of names, and for name-binding. Its axio...
متن کاملA Correctness Proof of a Speculative, Superscalar, Out-of-order, Renaming Microarchitecture | Extended Technical Report
Microarchitects are increasingly using techniques such as speculation, register renaming, and superscalar out-of-order execution to make use of instructionlevel parallelism. However, the growing complexity of modern microprocessors exacerbates the di culty of relating them to the simple machines that they emulate. Flaws found later in lower-level validation are often microarchitectural in natur...
متن کاملFreshness and Name-Restriction in Sets of Traces with Names
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 ...
متن کاملSeparated finitely supported $Cb$-sets
The monoid $Cb$ of name substitutions and the notion of finitely supported $Cb$-sets introduced by Pitts as a generalization of nominal sets. A simple finitely supported $Cb$-set is a one point extension of a cyclic nominal set. The support map of a simple finitely supported $Cb$-set is an injective map. Also, for every two distinct elements of a simple finitely supported $Cb$-set, there exists...
متن کامل