Contractive functions on infinite data structuresTools Capretta, Venanzio, Hutton, Graham and Jaskelioff, Mauro (2017) Contractive functions on infinite data structures. In: 28th symposium on Implementation and Application of Functional Languages, August 31 - September 2, 2016, Leuven, Belgium. (In Press) This is the latest version of this item.
Official URL: http://dx.doi.org/10.1145/3064899.3064900
AbstractCoinductive data structures, such as streams or infinite trees, have many applications in functional programming and type theory, and are naturally defined using recursive equations. But how do we ensure that such equations make sense, i.e. that they actually generate a productive infinite object? A standard means to achieve productivity is to use Banach’s fixed-point theorem, which guarantees the unique existence of solutions to recursive equations on metric spaces under certain conditions. Functions satisfying these conditions are called contractions. In this article, we give a new characterization of contractions on streams in the form of a sound and complete representation theorem, and generalize this result to a wide class of non-well-founded structures, first to infinite binary trees, then to final coalgebras of container functors. These results have important potential applications in functional programming, where coinduction and corecursion are successfully deployed to model continuous reactive systems, dynamic interactivity, signal processing, and other tasks that require flexible manipulation of non-well-founded data. Our representation theorems provide a definition paradigm to compactly compute with such data and easily reason about them.
Available Versions of this Item
Actions (Archive Staff Only)
|
Tools
Tools
