The question addressed in this paper is how to correctly approximate infinite data given by systems of simultaneous corecursive definitions. We devise a categorical framework for reasoning about regular datatypes, that is, datatypes closed under products, coproducts and fixpoints. We argue that the right methodology is on one hand coalgebraic (to deal with possible nontermination and infinite data) and on the other hand 2-categorical (to deal with parameters in a disciplined manner). We prove a coalgebraic version of Bekic lemma that allows us to reduce simultaneous fixpoints to a single fix point. Thus a possibly infinite object of interest is regarded as a final coalgebra of a many-sorted polynomial functor and can be seen as a limit of finite approximants. As an application, we prove correctness of a generic function that calculates the approximants on a large class of data types.
A. Kurz, A. Pardo, D. Petrisan, P. Severi, and F.-J. De Vries, “Approximation of Nested Fixpoints -- A Coalgebraic View of Parametric Dataypes,” Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2015. DOI: 10.4230/LIPIcs.CALCO.2015.205
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Algebra Commons, Logic and Foundations Commons, Other Computer Engineering Commons, Other Computer Sciences Commons, Other Mathematics Commons
This paper was originally presented at the Conference on Algebra and Coalgebra in Computer Science (CALCO) in 2015. DOI: 10.4230/LIPIcs.CALCO.2015.205