BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:John Baez (UC Riverside)
DTSTART:20200409T160100Z
DTEND:20200409T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/1
DESCRIPTION:Title: Structured cospans\nby John Baez (UC Riverside) as part of MIT (
applied) categories seminar\n\n\nAbstract\n"Structured cospans" are a gene
ral way to study networks with inputs and outputs. Here we illustrate this
using a type of network popular in theoretical computer science: Petri ne
ts. An "open" Petri net is one with certain places designated as inputs an
d outputs. We can compose open Petri nets by gluing the outputs of one to
the inputs of another. Using the formalism of structured cospans\, open Pe
tri nets can be treated as morphisms of a symmetric monoidal category - or
better\, a symmetric monoidal double category. We explain two forms of se
mantics for open Petri nets using symmetric monoidal double functors out o
f this double category. The first\, an operational semantics\, gives for e
ach open Petri net a category whose morphisms are the processes that this
net can carry out. The second\, a "reachability" semantics\, simply says w
hich markings of the outputs can be reached from a given marking of the in
puts. This is joint work with Kenny Courser and Jade Master.\n
LOCATION:https://researchseminars.org/talk/MITCategories/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Joachim Kock (Universitat Autonoma de Barcelona)
DTSTART:20200416T160100Z
DTEND:20200416T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/2
DESCRIPTION:Title: The incidence comodule bialgebra of the Baez--Dolan construction
\nby Joachim Kock (Universitat Autonoma de Barcelona) as part of MIT (appl
ied) categories seminar\n\n\nAbstract\nStarting from any operad P\, one ca
n consider on one hand the free operad on P\, and on the other hand the Ba
ez--Dolan construction on P. These two new operads have the same space of
operations\, but with very different notions of arity and substitution. Th
e main result is that the incidence bialgebras of the two-sided bar constr
uctions of the two operads constitute together a comodule bialgebra. The m
otivating example is the Calaque--Ebrahimi-Fard--Manchon comodule bialgebr
a of trees from numerical analysis. The purpose of the talk is to explain
all the concepts mentioned in the abstract\, and also some background on p
olynomial monads\, simplicial groupoids\, and homotopy combinatorics.\n\nR
eference: http://arxiv.org/abs/1912.11320\n
LOCATION:https://researchseminars.org/talk/MITCategories/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sophie Libkind (Stanford)
DTSTART:20200430T160000Z
DTEND:20200430T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/3
DESCRIPTION:Title: Unifying Open Dynamical Systems: An Algebra of Resource Sharing Mach
ines\nby Sophie Libkind (Stanford) as part of MIT (applied) categories
seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bob Coecke (Oxford)
DTSTART:20200507T160000Z
DTEND:20200507T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/4
DESCRIPTION:Title: Quantum Natural Language Processing (QNLP)\nby Bob Coecke (Oxfor
d) as part of MIT (applied) categories seminar\n\n\nAbstract\nRecently we
performed quantum natural language processing on an IBM quantum computer [
1]. What got us to the point is the observation that quantum theory and na
tural language are governed by much of the same category-theoretic structu
re [2]. From a ML perspective\, QNLP is arguably the first form of composi
tional machine learning where composition embodies a fundamental structure
of the data involved\, and which is moreover also native to the hardware
it is implemented on.\n\nThe talk requires no background in quantum theory
\, nor in natural language theory\, nor in machine learning. All relevant
references are in [1\, 2]\, where there are also the names of the people i
nvolved in getting to this point.\n\n[1] B. Coecke\, G. De Felice\, K. Mei
chanetzidis & A. Toumi (2020) Quantum Natural Language Processing: We did
it! https://medium.com/cambridge-quantum-computing/quantum-natural-languag
e-processing-748d6f27b31d.\n\n[2] B. Coecke (2016) From quantum foundation
s via natural language meaning to a theory of everything. arXiv:1602.07618
.\n
LOCATION:https://researchseminars.org/talk/MITCategories/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mike Shulman (San Diego)
DTSTART:20200514T160000Z
DTEND:20200514T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/5
DESCRIPTION:Title: Conservativity of duals\nby Mike Shulman (San Diego) as part of
MIT (applied) categories seminar\n\n\nAbstract\nDual objects in monoidal c
ategories have many applications\, including channels in parallel programm
ing\, input-output modes in logic programming\, and string diagrams for in
ternal-homs. Thus\, it is natural to ask whether duals intrinsically stren
gthen the theory\, i.e. whether monoidal categories with duals are "conser
vative"\, in a suitable sense\, over monoidal categories without duals. Wh
ile "compact closed" duals are not generally conservative\, we show that "
∗-autonomous" duals frequently are: in particular\, the free extension o
f any closed symmetric monoidal category to a ∗-autonomous category is a
fully faithful embedding. Thus\, "richer" languages with ∗-autonomous d
uals can be unambiguously used to reason about "poorer" languages that lac
k them.\n\nThis talk is about the same paper as my talk at ACT@UCR\, but t
he talks will be complementary\, with no expectation that anyone attending
this talk has seen the other one.\n
LOCATION:https://researchseminars.org/talk/MITCategories/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jade Master (UC Riverside)
DTSTART:20200521T160000Z
DTEND:20200521T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/6
DESCRIPTION:Title: The Open Algebraic Path Problem\nby Jade Master (UC Riverside) a
s part of MIT (applied) categories seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Spivak (MIT)
DTSTART:20200528T160000Z
DTEND:20200528T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/7
DESCRIPTION:Title: Polynomial functors II: Seven wonders of the composition product
\nby David Spivak (MIT) as part of MIT (applied) categories seminar\n\n\nA
bstract\nOn March 5 in this seminar\, I discussed the category Poly of pol
ynomial functors on Set and its applications to mode-dependent dynamical s
ystems—machines that can change their interface and which other machines
they wire to\, based on their internal state.\n\nAt that time\, I didn't
know how to think about the composition monoidal structure on Poly in term
s of dynamical systems\, but it turns out that the story is quite nice. Th
e composition product can be used to model strategies in the sense of game
theory\, as well as a way to "speed up" dynamical systems. But it comes w
ith lots of other surprises too\, both theoretical and applied\, e.g. due
to Gambino and Kock\, Ahman and Uustalu\, and Garner. It's a truly remarka
ble monoidal category.\n\nIn this talk I'll briefly review the previous on
e\, so no special background is necessary.\n
LOCATION:https://researchseminars.org/talk/MITCategories/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Carmen Constantin (Oxford)
DTSTART:20200604T160000Z
DTEND:20200604T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/8
DESCRIPTION:Title: Topos Theoretic Perspective on Entropy\nby Carmen Constantin (Ox
ford) as part of MIT (applied) categories seminar\n\n\nAbstract\nIn this t
alk I’ll be discussing an attempt to treat classical and quantum entropi
es in a unified setting which takes contextuality into account explicitly.
I will show how this construction inherits most of the properties of its
classical and quantum counterparts\, and moreover encodes sufficient infor
mation to allow us to reconstruct quantum states directly from it.\n
LOCATION:https://researchseminars.org/talk/MITCategories/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paolo Perrone (MIT)
DTSTART:20200611T160000Z
DTEND:20200611T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/9
DESCRIPTION:Title: Kan extensions are partial colimits\nby Paolo Perrone (MIT) as p
art of MIT (applied) categories seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Christian Williams (UC Riverside)
DTSTART:20200618T160000Z
DTEND:20200618T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/10
DESCRIPTION:Title: Predicate Calculus for Algebraic Type Theory\nby Christian Will
iams (UC Riverside) as part of MIT (applied) categories seminar\n\nAbstrac
t: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Remy Tuyeras (MIT)
DTSTART:20200625T160000Z
DTEND:20200625T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/11
DESCRIPTION:Title: A category theoretical argument for causal inference\nby Remy T
uyeras (MIT) as part of MIT (applied) categories seminar\n\nAbstract: TBA\
n
LOCATION:https://researchseminars.org/talk/MITCategories/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tobias Fritz (Perimeter Institute)
DTSTART:20200716T160000Z
DTEND:20200716T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/12
DESCRIPTION:Title: Probability theory with Markov categories\nby Tobias Fritz (Per
imeter Institute) as part of MIT (applied) categories seminar\n\nAbstract:
TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Evan Patterson (Stanford)
DTSTART:20200723T160000Z
DTEND:20200723T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/13
DESCRIPTION:Title: The algebra of statistical theories and m\nby Evan Patterson (S
tanford) as part of MIT (applied) categories seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Valeria de Paiva (Topos Institute)
DTSTART:20200806T160000Z
DTEND:20200806T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/14
DESCRIPTION:Title: Relevant Dialectica Categories\nby Valeria de Paiva (Topos Inst
itute) as part of MIT (applied) categories seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Toby St Clere Smithe (Oxford)
DTSTART:20200813T160000Z
DTEND:20200813T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/15
DESCRIPTION:Title: Active inference and compositional cybernetics\nby Toby St Cler
e Smithe (Oxford) as part of MIT (applied) categories seminar\n\nAbstract:
TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Maru Sarazola (Cornell)
DTSTART:20200820T160000Z
DTEND:20200820T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/16
DESCRIPTION:Title: A 2Cat-inspired model structure for double categories\nby Maru
Sarazola (Cornell) as part of MIT (applied) categories seminar\n\nAbstract
: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/16/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Michael Robinson (American University)
DTSTART:20200827T180000Z
DTEND:20200827T190000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/17
DESCRIPTION:Title: Assignments to sheaves of pseudometric spaces\nby Michael Robin
son (American University) as part of MIT (applied) categories seminar\n\n\
nAbstract\nAn assignment to a sheaf is the choice of a local section from
each open set in the sheaf's base space\, without regard to how these loca
l sections are related to one another. This article explains that the cons
istency radius --- which quantifies the agreement between overlapping loca
l sections in the assignment --- is a continuous map. When thresholded\, t
he consistency radius produces the consistency filtration\, which is a fil
tration of open covers. This article shows that the consistency filtration
is a functor that transforms the structure of the sheaf and assignment in
to a nested set of covers in a structure-preserving way. Furthermore\, thi
s article shows that consistency filtration is robust to perturbations\, e
stablishing its validity for arbitrarily thresholded\, noisy data.\n
LOCATION:https://researchseminars.org/talk/MITCategories/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eugenia Cheng (School of the Art Institute of Chicago)
DTSTART:20200730T160000Z
DTEND:20200730T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/18
DESCRIPTION:Title: Distributive laws for Lawvere theories\nby Eugenia Cheng (Schoo
l of the Art Institute of Chicago) as part of MIT (applied) categories sem
inar\n\n\nAbstract\nDistributive laws give a way of combining two algebrai
c structures expressed as monads\; in this paper we propose a theory of di
stributive laws for combining algebraic structures expressed as Lawvere th
eories. We propose four approaches\, involving profunctors\, monoidal prof
unctors\, an extension of the free finite-product category 2-monad from Ca
t to Prof\, and factorisation systems respectively. We exhibit comparison
functors between CAT and each of these new frameworks to show that the dis
tributive laws between the Lawvere theories correspond in a suitable way t
o distributive laws between their associated finitary monads. The differen
t but equivalent formulations then provide\, between them\, a framework co
nducive to generalisation\, but also an explicit description of the compos
ite theories arising from distributive laws.\n\nThis talk is part of a ser
ies on recently published papers in the journal Compositionality. The pape
r can be found here.\n
LOCATION:https://researchseminars.org/talk/MITCategories/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Prakash Panangaden (McGill University)
DTSTART:20200903T160000Z
DTEND:20200903T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/19
DESCRIPTION:Title: Projective limits of Markov processes\nby Prakash Panangaden (M
cGill University) as part of MIT (applied) categories seminar\n\nAbstract:
TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Brandon Shapiro (Cornell University)
DTSTART:20200910T160000Z
DTEND:20200910T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/20
DESCRIPTION:Title: Compositional structure of partial evaluations\nby Brandon Shap
iro (Cornell University) as part of MIT (applied) categories seminar\n\nAb
stract: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Spivak (MIT)
DTSTART:20200917T160000Z
DTEND:20200917T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/21
DESCRIPTION:Title: Categories = polynomial comonads\nby David Spivak (MIT) as part
of MIT (applied) categories seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eigil Rischel (University of Strathclyde)
DTSTART:20201119T170000Z
DTEND:20201119T180000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/22
DESCRIPTION:Title: Infinite products and zero-one law in categorical probability\n
by Eigil Rischel (University of Strathclyde) as part of MIT (applied) cate
gories seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Juan Orendain (UNAM)
DTSTART:20200924T160000Z
DTEND:20200924T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/23
DESCRIPTION:by Juan Orendain (UNAM) as part of MIT (applied) categories se
minar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Jaz Myers (Johns Hopkins University)
DTSTART:20201001T160000Z
DTEND:20201001T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/24
DESCRIPTION:Title: Paradigms of composition\nby David Jaz Myers (Johns Hopkins Uni
versity) as part of MIT (applied) categories seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/24/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Robert Paré (Dalhousie University)
DTSTART:20201008T160000Z
DTEND:20201008T170000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/25
DESCRIPTION:Title: Retro cells\nby Robert Paré (Dalhousie University) as part of
MIT (applied) categories seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/25/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Arthur Parzygnat (IHES Paris)
DTSTART:20201203T170000Z
DTEND:20201203T180000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/26
DESCRIPTION:Title: Stinespring's construction as an adjunction\nby Arthur Parzygna
t (IHES Paris) as part of MIT (applied) categories seminar\n\nAbstract: TB
A\n
LOCATION:https://researchseminars.org/talk/MITCategories/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Evan Patterson (University of Stanford)
DTSTART:20201210T170000Z
DTEND:20201210T180000Z
DTSTAMP:20260422T212554Z
UID:MITCategories/27
DESCRIPTION:Title: (Co)relational computing in Catlab: The operad of UWDs and its alge
bras\nby Evan Patterson (University of Stanford) as part of MIT (appli
ed) categories seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/MITCategories/27/
END:VEVENT
END:VCALENDAR