Name
Abstract | ||
|---|---|---|
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 Beki£ 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. 1998 ACM Subject Classification F.3.2 Semantics of Programming Languages |
Year | Venue | Field |
|---|---|---|
2015 | CALCO | Discrete mathematics,Polynomial,Categorical variable,Computer science,Coalgebra,Correctness,Functor,Data type,Generic function,Lemma (mathematics) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
9 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Kurz | 1 | 12 | 1.34 |
| Alberto Pardo | 2 | 125 | 14.46 |
| Daniela Petrisan | 3 | 56 | 8.54 |
| Paula Severi | 4 | 122 | 16.19 |
| Fer-Jan de Vries | 5 | 244 | 21.67 |