English

Regular Behaviours with Names

Logic in Computer Science 2016-07-27 v1

Abstract

Nominal sets provide a framework to study key notions of syntax and semantics such as fresh names, variable binding and α\alpha-equivalence on a conveniently abstract categorical level. Coalgebras for endofunctors on nominal sets model, e.g., various forms of automata with names as well as infinite terms with variable binding operators (such as λ\lambda-abstraction). Here, we first study the behaviour of orbit-finite coalgebras for functors Fˉ\bar F on nominal sets that lift some finitary set functor FF. We provide sufficient conditions under which the rational fixpoint of Fˉ\bar F, i.e. the collection of all behaviours of orbit-finite Fˉ\bar F-coalgebras, is the lifting of the rational fixpoint of FF. Second, we describe the rational fixpoint of the quotient functors: we introduce the notion of a sub-strength of an endofunctor on nominal sets, and we prove that for a functor GG with a sub-strength the rational fixpoint of each quotient of GG is a canonical quotient of the rational fixpoint of GG. As applications, we obtain a concrete description of the rational fixpoint for functors arising from so-called binding signatures with exponentiation, such as those arising in coalgebraic models of infinitary λ\lambda-terms and various flavours of automata.

Keywords

Cite

@article{arxiv.1607.07828,
  title  = {Regular Behaviours with Names},
  author = {Stefan Milius and Lutz Schröder and Thorsten Wißmann},
  journal= {arXiv preprint arXiv:1607.07828},
  year   = {2016}
}
R2 v1 2026-06-22T15:04:51.473Z