2010-09-01
Coalgebraic Representation Theory of Fractals
Publication
Publication
Electronic Notes in Theoretical Computer Science , Volume 265 p. 351- 368
We develop a \emph{representation theory} in which a point of a fractal specified by \emph{metric} means (by a variant of an \emph{iterated function system, IFS}) is represented by a suitable equivalence class of infinite streams of symbols. The framework is categorical: symbolic representatives carry a final coalgebra; an IFS-like metric specification of a fractal is an algebra for the same functor. Relating the two there canonically arises a \emph{representation map}, much like in America and Rutten's use of metric enrichment in denotational semantics. A distinctive feature of our framework is that the canonical representation map is bijective. In the technical development, \emph{gluing} of shapes in a fractal specification is a major challenge. On the metric side we introduce the notion of \emph{injective IFS} to be used in place of conventional IFSs. On the symbolic side we employ Leinster's presheaf framework that uniformly addresses necessary identification of streams---such as $.0111\dotsc=.1000\dotsc$ in the binary expansion of real numbers. Our leading example is the unit interval $\mathbb{I} = [0,1]$.
Additional Metadata | |
---|---|
, , , , | |
Elsevier | |
M.W. Mislove , P. Selinger | |
Electronic Notes in Theoretical Computer Science | |
Mending the Unending: Machine Assisted Reasoning with Infinite Objects | |
Conference on the Mathematical Foundations of Programming Semantics | |
Organisation | Computer Security |
Hasuo, I., Jacobs, B. P. F., & Niqui, M. (2010). Coalgebraic Representation Theory of Fractals. In M. W. Mislove & P. Selinger (Eds.), Electronic Notes in Theoretical Computer Science (Vol. 265, pp. 351–368). Elsevier. |