activity
20122022
most citedA Universal Construction for (Co)Relations

66 citations · 295 across the 23 of their papers we have counts for

collaborators
Showing math.CTShow all

13 papers · 1 filter

math.CT2021

Regular Calculi I: Graphical Regular Logic

Tslil Clingman, Brendan Fong, David I. Spivak

What is ergonomic syntax for relations? In this first paper in a series of two, to answer the question we define regular calculi: a suitably structured functor from a category repr…

math.CT2019★ 5 cited

Regular and relational categories: Revisiting 'Cartesian bicategories I'

Brendan Fong, David I Spivak

Regular logic is the fragment of first order logic generated by , , , and . A key feature of this logic is that it is the minimal fragment required to exp…

math.CT2019★ 10 cited

Supplying bells and whistles in symmetric monoidal categories

Brendan Fong, David I Spivak

It is common to encounter symmetric monoidal categories for which every object is equipped with an algebraic structure, in a way that is compatible with the monoidal…

math.CT2018

A recipe for black box functors

Brendan Fong, Maru Sarazola

The task of constructing compositional semantics for network-style diagrammatic languages, such as electrical circuits or chemical reaction networks, has been dubbed the black boxi…

math.CT2018★ 5 cited

Graphical Regular Logic

Brendan Fong, David I Spivak

Regular logic can be regarded as the internal language of regular categories, but the logic itself is generally not given a categorical treatment. In this paper, we understand the…

math.CT2018★ 1 cited

Hypergraph Categories

Brendan Fong, David I Spivak

Hypergraph categories have been rediscovered at least five times, under various names, including well-supported compact closed categories, dgs-monoidal categories, and dungeon cate…

math.CT2018★ 40 cited

Seven Sketches in Compositionality: An Invitation to Applied Category Theory

Brendan Fong, David I Spivak

This book is an invitation to discover advanced topics in category theory through concrete, real-world examples. It aims to give a tour: a gentle, quick introduction to guide later…

math.CT2017

Backprop as Functor: A compositional perspective on supervised learning

Brendan Fong, David I. Spivak, Rémy Tuyéras

A supervised learning algorithm searches over a set of functions parametrised by a space to find the best approximation to some ideal function . It d…

math.CT2017★ 9 cited

Decorated Corelations

Brendan Fong

Let be a category with finite colimits, and let be a factorisation system on with stable under pushouts. Writing $\…

math.CT2016

The Algebra of Open and Interconnected Systems

Brendan Fong

Herein we develop category-theoretic tools for understanding network-style diagrammatic languages. The archetypal network-style diagrammatic language is that of electric circuits;…

math.CT2016★ 20 cited

Corelations are the prop for extraspecial commutative Frobenius monoids

Brandon Coya, Brendan Fong

Just as binary relations between sets may be understood as jointly monic spans, so too may equivalence relations on the disjoint union of sets be understood as jointly epic cospans…

math.CT2015

A Compositional Framework for Passive Linear Networks

John C. Baez, Brendan Fong

Passive linear networks are used in a wide variety of engineering applications, but the best studied are electrical circuits made of resistors, inductors and capacitors. We describ…

math.CT2015★ 7 cited

Decorated Cospans

Brendan Fong

Let be a category with finite colimits, writing its coproduct , and let be a braided monoidal category. We describe a method of producing a…