Timeline for Are there proof assistants whose core uses category theory?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 8 at 10:42 | history | became hot network question | |||
| May 8 at 8:01 | answer | added | Andrej Bauer | timeline score: 6 | |
| May 8 at 4:24 | comment | added | siegment | Does something like Metamath + first-order theory of an abstract category count? | |
| May 8 at 0:05 | comment | added | Chris Henson | I mean your second comment, that "category" (maybe along with functors, natural transformations, etc.) is the fundamental notion. I ran across this paper A Formal Logic for Formal Category Theory that seems to be somewhat in that direction, embedded in Agda. I have not seen any standalone proof assistants. | |
| May 7 at 20:43 | comment | added | Jason Rute | Or is the point that “category” should be the fundamental notion instead of say “set”, “type”, or “function”? I think this is what ETCC does, but I don’t think it is in any proof assistant. I guess I have also heard of people trying to come up with a type theory where the types represent (higher?) categories (instead of sets, groupoids, etc). I don’t know if there has been progress. | |
| May 7 at 20:36 | comment | added | Jason Rute | What do you mean by a core which uses category theory? Like first order logic with ETCS (or ETCC) instead of ZFC? If not, then one could argue that type theory is just formal category theory. (Although I guess one could take a category-theoretic-first approach to designing the type system making sure it is exactly the semantics of a particular family of categories, like a topos. Maybe homotopy type theory fits that bill.) | |
| May 7 at 18:48 | history | asked | Chris Henson | CC BY-SA 4.0 |