English
Related papers

Related papers: Profunctor Optics, a Categorical Update

200 papers

Optics are bidirectional accessors of data structures; they provide a powerful abstraction of many common data transformations. This abstraction is compositional thanks to a representation in terms of profunctors endowed with an algebraic…

Programming Languages · Computer Science 2020-01-23 Mario Román

Optics, aka functional references, are classes of tools that allow composable access into compound data structures. Usually defined as programming language libraries, they provide combinators to manipulate different shapes of data such as…

Programming Languages · Computer Science 2020-02-03 Guillaume Boisseau

CONTEXT: Data accessors allow one to read and write components of a data structure, such as the fields of a record, the variants of a union, or the elements of a container. These data accessors are collectively known as optics; they are…

Programming Languages · Computer Science 2017-04-03 Matthew Pickering , Jeremy Gibbons , Nicolas Wu

Tambara modules are strong profunctors between monoidal categories. They've been defined by Tambara in the context of representation theory, but quickly found their way in applications when it was understood Tambara modules provide a useful…

Category Theory · Mathematics 2022-04-25 Matteo Capucci

A wide variety of bidirectional data accessors, ranging from mixed optics to functor lenses, can be formalized within a unique framework-dependent optics. Starting from two indexed categories, which encode what maps are allowed in the…

Category Theory · Mathematics 2023-08-01 Pietro Vertechi

Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…

Logic in Computer Science · Computer Science 2022-07-21 Gershom Bazerman

Bidirectional data accessors such as lenses, prisms and traversals are all instances of the same general 'optic' construction. We give a careful account of this construction and show that it extends to a functor from the category of…

Category Theory · Mathematics 2018-09-10 Mitchell Riley

We study monoidal profunctors as a tool to reason and structure pure functional programs both from a categorical perspective and as a Haskell implementation. From the categorical point of view we approach them as monoids in a certain…

Programming Languages · Computer Science 2022-07-05 Alexandre Garcia de Oliveira , Mauro Jaskelioff , Ana Cristina Vieira de Melo

Lenses, optics and dependent lenses (or equivalently morphisms of containers, or equivalently natural transformations of polynomial functors) are all widely used in applied category theory as models of bidirectional processes. From the…

Category Theory · Mathematics 2021-12-22 Dylan Braithwaite , Matteo Capucci , Bruno Gavranović , Jules Hedges , Eigil Fjeldgren Rischel

Simple optics are defined using actions of monoidal categories. Compound optics arise, for instance, as natural transformations between polynomial functors. Since a monoidal category is a special case of a bicategory, we formulate complex…

Category Theory · Mathematics 2022-03-24 Bartosz Milewski

Optics and lenses are abstract categorical gadgets that model systems with bidirectional data flow. In this paper we observe that the denotational definition of optics - identifying two optics as equivalent by observing their behaviour from…

Category Theory · Mathematics 2022-09-21 Bruno Gavranović

Traversals of data structures are ubiquitous in programming. Consequently, it is important to be able to characterise those structures that are traversable and understand their algebraic properties. Traversable functors have been…

Programming Languages · Computer Science 2012-02-15 Mauro Jaskelioff , Ondrej Rypacek

Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…

Programming Languages · Computer Science 2015-02-05 Mauro Jaskelioff , Russell O'Connor

This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…

Category Theory · Mathematics 2024-10-31 Amar Hadzihasanovic

Functional programmers have an established tradition of using traversals as a design pattern to work with recursive data structures. The technique is so prolific that a whole host of libraries have been designed to help in the task of…

Programming Languages · Computer Science 2018-05-18 Csongor Kiss , Matthew Pickering , Nicolas Wu

Optics are a data representation for compositional data access, with lenses as a popular special case. Hedges has presented a diagrammatic calculus for lenses, but in a way that does not generalize to other classes of optic. We present a…

Category Theory · Mathematics 2020-05-13 Guillaume Boisseau

Categories of lenses/optics and Dialectica categories are both comprised of bidirectional morphisms of basically the same form. In this work we show how they can be considered a special case of an overarching fibrational construction,…

Category Theory · Mathematics 2024-12-18 Matteo Capucci , Bruno Gavranović , Abdullah Malik , Francisco Rios , Jonathan Weinberger

Lenses are a well-established structure for modelling bidirectional transformations, such as the interactions between a database and a view of it. Lenses may be symmetric or asymmetric, and may be composed, forming the morphisms of a…

Machine Learning · Computer Science 2019-05-03 Brendan Fong , Michael Johnson

Openable part detection is the task of detecting the openable parts of an object in a single-view image, and predicting corresponding motion parameters. Prior work investigated the unrealistic setting where all input images only contain a…

Computer Vision and Pattern Recognition · Computer Science 2023-03-27 Xiaohao Sun , Hanxiao Jiang , Manolis Savva , Angel Xuan Chang

Fibrations over a category $B$, introduced to category theory by Grothendieck, encode pseudo-functors $B^{op} \rightsquigarrow {\bf Cat}$, while the special case of discrete fibrations encode presheaves $B^{op} \to {\bf Set}$. A two-sided…

Category Theory · Mathematics 2020-06-02 Fosco Loregian , Emily Riehl
‹ Prev 1 2 3 10 Next ›