Abstract
Nominal sets, introduced to Computer Science by Gabbay and Pitts, are useful for modeling computation on data structures built of atoms that can only be compared for equality. In certain contexts it is useful to consider atoms equipped with some nontrivial structure that can be tested in computation. Here, we study nominal sets over atoms equipped with both relational and algebraic structure. Our main result is a representation theorem for orbit-finite nominal sets over such atoms, a generalization of a previously known result for atoms equipped with relational structure only. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Ochremiak, J. (2014). Nominal sets over algebraic atoms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8428 LNCS, pp. 429–445). Springer Verlag. https://doi.org/10.1007/978-3-319-06251-8_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
