Base modules for parametrized iterativity

• Published in: Theoretical computer science Vol. 523; pp. 56 - 85
• Main Authors: Adámek, Jiří, Milius, Stefan, Velebil, Jiří
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 27.02.2014
• Subjects: Iterative monad; Parametrized monad; Recursion; Recursion; Parametrized monad; Iterative monad
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2013.12.019

The concept of a base, that is a parametrized finitary monad, which we introduced earlier, followed the footsteps of Tarmo Uustalu in his attempt to formalize parametrized recursion. We proved that for every base free iterative algebras exist, and we called the corresponding monad the rational monad of the base. Here we introduce modules for a base, and we prove that the rational monad of a base gives rise to a canonical module, that is characterized as the free iterative module on the given base. This generalizes the classical, nonparametric case of iterative Σ-algebras whose rational monad is the monad of rational Σ-trees and that was characterized by Calvin Elgot et al. as the free iterative monad on Σ. A basic parametrized example is the base assigning to every parameter set X the monad A↦X⁎×A whose rational monad is the monad of all right-wellfounded rational binary trees; the rational module for this base is the natural transformation (X⁎×X)×A→X⁎×A given by parametrized concatenation.