You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
@Conor McBride hopefully we could do category theory in type theory soon.
That could be persuaded to suck a lot less, if we put our minds to it.
Do you have a roadmap? (beyond the Berlin talk)
It would be excessive to say I had a roadmap. I have some clues. E.g., I have a universe of presheaves-by-construction, but I seriously doubt it catches them all.
What about natural transformations? ;)
@Ohad Kammar @Conor McBride: could you move this into another topic, so we can keep this topic for introductions? :)
(you can move existing messages by editing them, and changing the topic)
Done! Ta
thanks!
On the one hand, where's my free theorem? On the other hand, what's the normalisation-by-evaluation algorithm for definitional equalities up to free theorems? But that presupposes knowing which functions on objects lift to functors, and we're not there yet. Worse, our current setup forces us to discover that we have categorical structure post facto. We can't do it deliberately even if we know what we're doing. It's so frustrating!
what was the topic of the Berlin talk?
https://icfp19.sigplan.org/details/tyde-2019-papers/17/Cubes-Cats-Effects
patty johann has a (new refinement) on this take, where every datatype remains a functor
But you said 'functions', not 'types', so maybe that won't help either.
I don't know what happened to the video from that talk. Maybe there were too many cartoons. Maybe I swore too much.
I said functions because coherence with respect to structure in small categories is hugely important. People who speak of "Hask" (the 'category' of Haskell types and functions) risk missing other categories at work in Haskell programming. We should write homomorphisms, not functions. And if the source has only discrete structure, we are none the worse off. At the moment, we don't even try to be rich.
Yes, that's what I meant when I asked about cats in TT.
And yes, functorial-by-construction is nice, but even if I was happy to do the legwork and prove functoriality manually, naturality is still a spanner
Shame that there is no video for the talk, that seems extremely interesting :slight_smile: If you don't mind me asking, are there slides available anywhere?
The slides were hand-drawn and presented "live" with cardboard animations, using my phone as a document camera. They're in my sketchbook, not in a file. Luckily, my sketchbook is in the same quarantine pod as me, so I could photograph the slides and put a (large) pdf somewhere, given time.
@David Jaz is giving a talk on this topic today at the MIT categories seminar: http://brendanfong.com/seminar.html
That would be great. Which problems were you in particular trying to solve?
It is my understanding (though perhaps faulty) that Ali Caglayan and Mike Shulman have been working a lot on overcoming coherence issues in intensional TT. Something about threading coherence data through modules describing categories in Coq, I am told.
Hi everybody!
In 30 minutes I'll be giving a talk for the MIT Categories Seminar. It will be an introduction to HoTT, geared towards people who use categories.
Cheers!
@David Jaz do you know if this will be recorded and available to watch later?
It will be recorded and put on Youtube on the same channel.
@David Jaz did you have a thread you wanted to do the chat in?
James Fairbanks said:
David Jaz did you have a thread you wanted to do the chat in?
It is under the MIT Categories Seminar stream
Well... it was my first online attendance to a MIT Categories Seminar! Great job! Many thanks to the speaker and to the organizers! Beppe.
I'd be happy to share something of what we're working on in the HoTT/Coq (with Ali as well as @Emily Riehl and others), but I don't quite know what entry point here people are interested in. E.g. exactly what coherence issues were you worried about? (I'm looking forward to watching David's talk too when the recording is posted.)
What is the precise relationship between parametricity and naturality of transformations?
there's a detailed exploration of parametricity (and naturality) in Logical Relations and Parametricity - A Reynolds Programme for Category Theory and Programming Languages (https://www.cs.bham.ac.uk/~udr/papers/logical-relations-and-parametricity.pdf)
Thanks!
hi, there is also older work, e.g. the thesis of Paola Maneggia in Birmingham on Parametricity and Linear Logic http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.121.9751&rep=rep1&type=pdf
Ah, that reminds me of Computability Logic and its distinction between several universal quantifiers, including a "blinded" universal quantifier, that corresponds to Parametricity. Game Semantics FTW.
But I'm not sure how THAT ties into Category Theory.
Section 6 of the Reynolds paper is giving me flashbacks to reading the notes about framed bicategories.
f r a m ed bi ca te gori e s :ghost:
who would frame a bicategory? for what crime?
For stealing the proarrow equipment.
So apparently my pain threshold is way too high. I have not been too bothered with doing CT in Agda. Ok, once into Enriched land, type-checking is starting to be a bit sluggish, and debugging that is somewhat of a pain.
The current pain is trying to do Multicategories. Mainly because all human-mathematics presentations make copious use of "..." and depends in really crucial ways on the ordinal structure of the natural numbers (and taking that for granted, because that's baby mathematics). Formalizing that elegantly is my current challenge.
Agda wanted me to use 'subst' (aka transport) many many times. I refused its siren song - successfully. I'll write about that later, but the solutions all were imported from Partial Evaluation: if you don't want 'x + 0' to show up, then never write it down. You do that by using a 'sum' that internalizes its own properties, so has 3 cases instead of the naive 2 that a foldr-based implementation typically has.
hott/coq ... i'll bite. i've read some of the literature and run the binaries a token number of times. rake++
Hi, just wondering what people felt were the latest (best?) libraries to prove Category Theory structures using Proof Assistants?
I found this paper from 2014 by @David Spivak Experience Implementing a Performant Category-Theory Library in Coq.
And looking through this thread I found @David Jaz's HoTT type theory for doing Category Theory has been posted.
I'll go through those to going as a help to teach me to map between Category Theory and Type Theory. But would be interested to know what else people recognize now, 6 years later.
I found the The HoTT library - a Formalization of Homotopy Type Theory in Coq. It is interesting to compare the HoTT book definitions with the implementation HoTT Coq Category library for example.
The library I'm most familiar with is agda-categories, by @Jacques Carette and contributors. It's done in plainish MLTT, and based on E-categories (that is, an ordinary category is a category enriched in setoids). I've found it to have a decent amount of stuff in it. The obvious drawback if you're interested in HoTT specifically is that the definitions are not made with HoTT in mind, so are likely to be inconvenient, or wrong if you care about equality.
@Scott Morrison made a small introduction for CT in Lean here.
Thanks, will share.
Jason and I wrote up our experience with writing agda-categories - see the web browsable version. We'll post an updated version of that paper once the embargo by the conference we've submitted to is lifted.