TY  - JOUR
N1  - SCOPUS ID: 2-s2.0-85020128814
ID  - eprints3952
EP  - 201
SN  - 0324-721X
N2  - In 2003 we showed that right-linear systems of equations over regular expressions, when interpreted in a category of trees, have a solution whenever they enjoy a specific property that we called hierarchicity and that is instrumental to avoid critical mutual recursive definitions. In this note, we prove that a right-linear system of polynomial endofunctors on a cocartesian monoidal closed category which enjoys parameterized left list arithmeticity, has an initial algebra, provided it satisfies a property similar to hierarchicity.
TI  - Initial Algebra for a System of Right-Linear Functors
AV  - none
UR  - https://doi.org/10.14232/actacyb.23.1.2017.12
VL  - 23
A1  - Labella, Anna
A1  - De Nicola, Rocco
PB  - Institute of Informatics, University of Szeged
SP  - 191
Y1  - 2017///
IS  - 1
JF  - Acta Cybernetica
ER  -