home.social

#categorytheory — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #categorytheory, aggregated by home.social.

  1. 📚🤖 "Behold! The magnum opus on #Rust and Category Theory that's sure to revolutionize your understanding of... nothing. 😂 Dive into this unfinished 'draft' if you're into the esoteric joy of turning simple concepts into convoluted gibberish. 🚀👨‍💻✨"
    hghalebi.github.io/category_th #CategoryTheory #EsotericHumor #TechHumor #Programming #HackerNews #ngated

  2. Towards a Higher-Order Bialgebraic Denotational Semantics by Sergey Goncharov, @[email protected], @[email protected], Henning Urbat, and me has been (unconditionally) accepted at ICFP'26! Abstract below ​:Blobhaj_Read_Octopus:​

    #icfp #functionalProgramming #programmingLanguages #semantics #coalgebra #categoryTheory

  3. The Tin Bullet: Show&Tell

    Aula 1206, Pabellón 0+infinito, lunes, 4 de mayo, 18:30 GMT-3

    Buenas! El lunes 4/5 (HOY!!!!) están invitados a la segunda edición de "The Tin Bullet" un evento de micro charlas en la facultad.

    La primer edición estuvo muy buena y se trajeron cosas muy piolas. Cópense y vengan a la segunda!

    Esta vez vamos a estirar las charlas a 10-15 minutos así hay mas espacio para exponer y consultar.

    Al final de la jornada tomamos un mate y charlamos sobre lo expuesto (La ultima vez colmamos MauroIT)

    En fin!! Los esperamos <3!!

    cartelera.inexactas.ar/event/t

  4. From 11:00 to 12:00 on Thursday, April 30, the PLUSLE reading group will discuss "Abstract Syntax and Variable Binding" by Marcelo Fiore, Gordon Plotkin, and Daniele Turi.

    plsl.acp.sdu.dk/posts/2026-04-

    #PLUSLE #syntax #programmingLanguages #categoryTheory #lambdaCalculus

  5. From 11:00 to 12:00 on Thursday, April 30, the PLUSLE reading group will discuss "Abstract Syntax and Variable Binding" by Marcelo Fiore, Gordon Plotkin, and Daniele Turi.

    plsl.acp.sdu.dk/posts/2026-04-

    #PLUSLE #syntax #programmingLanguages #categoryTheory #lambdaCalculus

  6. From 11:00 to 12:00 on Thursday, April 30, the PLSL reading group will discuss "Abstract Syntax and Variable Binding" by Marcelo Fiore, Gordon Plotkin, and Daniele Turi.

    plsl.acp.sdu.dk/posts/2026-04-

    #PLSL #syntax #programmingLanguages #categoryTheory

  7. Oh joy, another attempt at 'explaining' Category Theory using #orders, because clearly the first thing we all need is more #abstraction in our lives. 🎉 In a groundbreaking revelation, the article tells us orders are about #relationships. 🤯 Who knew binary relations could be so riveting? 🙄
    abuseofnotation.github.io/cate #CategoryTheory #HackerNews #HackerNews #ngated

  8. Oh joy, another attempt at 'explaining' Category Theory using #orders, because clearly the first thing we all need is more #abstraction in our lives. 🎉 In a groundbreaking revelation, the article tells us orders are about #relationships. 🤯 Who knew binary relations could be so riveting? 🙄
    abuseofnotation.github.io/cate #CategoryTheory #HackerNews #HackerNews #ngated

  9. Oh joy, another attempt at 'explaining' Category Theory using #orders, because clearly the first thing we all need is more #abstraction in our lives. 🎉 In a groundbreaking revelation, the article tells us orders are about #relationships. 🤯 Who knew binary relations could be so riveting? 🙄
    abuseofnotation.github.io/cate #CategoryTheory #HackerNews #HackerNews #ngated

  10. Oh joy, another attempt at 'explaining' Category Theory using #orders, because clearly the first thing we all need is more #abstraction in our lives. 🎉 In a groundbreaking revelation, the article tells us orders are about #relationships. 🤯 Who knew binary relations could be so riveting? 🙄
    abuseofnotation.github.io/cate #CategoryTheory #HackerNews #HackerNews #ngated

  11. Oh joy, another attempt at 'explaining' Category Theory using #orders, because clearly the first thing we all need is more #abstraction in our lives. 🎉 In a groundbreaking revelation, the article tells us orders are about #relationships. 🤯 Who knew binary relations could be so riveting? 🙄
    abuseofnotation.github.io/cate #CategoryTheory #HackerNews #HackerNews #ngated

  12. Someone should make one of those "top 10 most satisfying" videos but for #CategoryTheory diagram chasing proofs

  13. In the mountains, I love exploring nature and climbing any little hidden corner.

    My academic interests include mathematics (#mathematics) and mathematical logic ( #mathematicallogic #logic), particularly model theory ( #modeltheory), category theory ( #categorytheory), higher-order logic and metalogic ( #metalogic), as well as the philosophy of mathematics and logic ( #philosophyofmathematics #philosophyoflogic), epistemology and ontology of them.

    #introduction

  14. Thanks to our speakers and @Stiephen all the slides for PSSL 112 are now available on the PSSL website! sites.google.com/view/pssl112/

    #CategoryTheory #Logic

  15. Question for people with background in #categorytheory , which of the two is more correct/understandable:

    "A monoid is...

    #categorytheoryillustrated

  16. Propositions As Types Analogy • 1
    inquiryintoinquiry.com/2013/01

    One of my favorite mathematical tricks — it almost seems too tricky to be true — is the Propositions As Types Analogy. And I see hints the 2‑part analogy can be extended to a 3‑part analogy, as follows.

    Proof Hint ∶ Proof ∶ Proposition

    Untyped Term ∶ Typed Term ∶ Type

    or

    Proof Hint ∶ Untyped Term

    Proof ∶ Typed Term

    Proposition ∶ Type

    See my working notes on the Propositions As Types Analogy —
    oeis.org/wiki/Propositions_As_

    #Mathematics #CategoryTheory #ProofTheory #TypeTheory
    #Logic #Analogy #Isomorphism #PropositionalCalculus
    #CombinatorCalculus #CombinatoryLogic #LambdaCalculus
    #Peirce #LogicalGraphs #GraphTheory #RelationTheory

  17. Propositions As Types Analogy • 1
    inquiryintoinquiry.com/2013/01

    One of my favorite mathematical tricks — it almost seems too tricky to be true — is the Propositions As Types Analogy. And I see hints the 2‑part analogy can be extended to a 3‑part analogy, as follows.

    Proof Hint ∶ Proof ∶ Proposition

    Untyped Term ∶ Typed Term ∶ Type

    or

    Proof Hint ∶ Untyped Term

    Proof ∶ Typed Term

    Proposition ∶ Type

    See my working notes on the Propositions As Types Analogy —
    oeis.org/wiki/Propositions_As_

    #Mathematics #CategoryTheory #ProofTheory #TypeTheory
    #Logic #Analogy #Isomorphism #PropositionalCalculus
    #CombinatorCalculus #CombinatoryLogic #LambdaCalculus
    #Peirce #LogicalGraphs #GraphTheory #RelationTheory

  18. Propositions As Types Analogy • 1
    inquiryintoinquiry.com/2013/01

    One of my favorite mathematical tricks — it almost seems too tricky to be true — is the Propositions As Types Analogy. And I see hints the 2‑part analogy can be extended to a 3‑part analogy, as follows.

    Proof Hint ∶ Proof ∶ Proposition

    Untyped Term ∶ Typed Term ∶ Type

    or

    Proof Hint ∶ Untyped Term

    Proof ∶ Typed Term

    Proposition ∶ Type

    See my working notes on the Propositions As Types Analogy —
    oeis.org/wiki/Propositions_As_

    #Mathematics #CategoryTheory #ProofTheory #TypeTheory
    #Logic #Analogy #Isomorphism #PropositionalCalculus
    #CombinatorCalculus #CombinatoryLogic #LambdaCalculus
    #Peirce #LogicalGraphs #GraphTheory #RelationTheory

  19. Propositions As Types Analogy • 1
    inquiryintoinquiry.com/2013/01

    One of my favorite mathematical tricks — it almost seems too tricky to be true — is the Propositions As Types Analogy. And I see hints the 2‑part analogy can be extended to a 3‑part analogy, as follows.

    Proof Hint ∶ Proof ∶ Proposition

    Untyped Term ∶ Typed Term ∶ Type

    or

    Proof Hint ∶ Untyped Term

    Proof ∶ Typed Term

    Proposition ∶ Type

    See my working notes on the Propositions As Types Analogy —
    oeis.org/wiki/Propositions_As_

    #Mathematics #CategoryTheory #ProofTheory #TypeTheory
    #Logic #Analogy #Isomorphism #PropositionalCalculus
    #CombinatorCalculus #CombinatoryLogic #LambdaCalculus
    #Peirce #LogicalGraphs #GraphTheory #RelationTheory

  20. Propositions As Types Analogy • 1
    inquiryintoinquiry.com/2013/01

    One of my favorite mathematical tricks — it almost seems too tricky to be true — is the Propositions As Types Analogy. And I see hints the 2‑part analogy can be extended to a 3‑part analogy, as follows.

    Proof Hint ∶ Proof ∶ Proposition

    Untyped Term ∶ Typed Term ∶ Type

    or

    Proof Hint ∶ Untyped Term

    Proof ∶ Typed Term

    Proposition ∶ Type

    See my working notes on the Propositions As Types Analogy —
    oeis.org/wiki/Propositions_As_

    #Mathematics #CategoryTheory #ProofTheory #TypeTheory
    #Logic #Analogy #Isomorphism #PropositionalCalculus
    #CombinatorCalculus #CombinatoryLogic #LambdaCalculus
    #Peirce #LogicalGraphs #GraphTheory #RelationTheory

  21. Survey of Precursors Of Category Theory • 6
    inquiryintoinquiry.com/2025/05

    A few years ago I began a sketch on the “Precursors of Category Theory”, tracing the continuities of the category concept from Aristotle, to Kant and Peirce, through Hilbert and Ackermann, to contemporary mathematical practice. A Survey of resources on the topic is given below, still very rough and incomplete, but perhaps a few will find it of use.

    Background —

    Precursors Of Category Theory
    oeis.org/wiki/Precursors_Of_Ca

    Propositions As Types Analogy
    oeis.org/wiki/Propositions_As_

    Blog Series —

    Notes On Categories
    inquiryintoinquiry.com/2013/02

    Precursors Of Category Theory
    1. inquiryintoinquiry.com/2024/05
    2. inquiryintoinquiry.com/2024/05
    3. inquiryintoinquiry.com/2024/05
    4. inquiryintoinquiry.com/2024/05
    5. inquiryintoinquiry.com/2024/05
    6. inquiryintoinquiry.com/2024/05

    Precursors Of Category Theory • Discussion
    1. inquiryintoinquiry.com/2020/09
    2. inquiryintoinquiry.com/2020/09
    3. inquiryintoinquiry.com/2020/09

    Categories à la Peirce —

    C.S. Peirce • A Guess at the Riddle
    inquiryintoinquiry.com/2012/03

    Peirce's Categories
    1. inquiryintoinquiry.com/2015/10
    2. inquiryintoinquiry.com/2015/10
    3. inquiryintoinquiry.com/2015/11
    •••
    19. inquiryintoinquiry.com/2020/05
    20. inquiryintoinquiry.com/2020/05
    21. inquiryintoinquiry.com/2020/06

    C.S. Peirce and Category Theory
    1. inquiryintoinquiry.com/2021/06
    2. inquiryintoinquiry.com/2021/06
    3. inquiryintoinquiry.com/2021/06
    4. inquiryintoinquiry.com/2021/06
    5. inquiryintoinquiry.com/2021/06
    6. inquiryintoinquiry.com/2021/06
    7. inquiryintoinquiry.com/2021/07
    8. inquiryintoinquiry.com/2021/07

    #Aristotle #Peirce #Kant #Carnap #Hilbert #Ackermann #SaundersMacLane
    #Abstraction #Analogy #CategoryTheory #FunctionalLogic #RelationTheory
    #PrecursorsOfCategoryTheory #PropositionsAsTypes #Semiotics #TypeTheory

  22. Case in point.

    [note: if my future therapist is reading this, this may be in fact the point when it broke]

    Also holy fuck, this joke didn't go too far after all. I love category theory (as it turns out I speak it natively) and having my buttocks explained to me through it seems to be activating all the right shapes in my mind.

    Who knew I'd be using the ocular mirror to stare straight into my buttocks tonight to finally make sense of myself. Bridging the hyperlexic and embodied graphs through the shared medium of my delicious 🎂

    Thanks 🪿

    If anyone would care to read the particular projection of my thesis that happens to have taken on that shape it's below. It's a bit of a hard read, lots of ups and downs and the middle bit is really difficult to get through, but I find it worth it in the end.

    loss.dev/?node=my-buttocks-are

    #delicious #engineering #isitstill #rigourousproof #mathematics #categorytheory

  23. We've computationally verified that Peano arithmetic emerges naturally from just two operators: Δ (distinction/branching) and Σ (connection/composition).

    This isn't just coding — it's evidence for the Δ–Σ Turing Completeness Theorem: a system is Turing-complete iff it can be represented through Δ and Σ.

    Code implements the proofs: github.com/muskin88/delta-sigm
    Formal statement: zenodo.org/records/17895986
    (Theorem 3)

    The implications are ontological: these operators appear inevitable for any non-trivial reality. The framework unites computation, mathematics, and fundamental ontology.

    #CategoryTheory #FoundationsOfMath #Computation #Ontology #FormalMethods #TypeTheory #PeanoArithmetic #TuringCompleteness #MathematicalPhilosophy

  24. We've computationally verified that Peano arithmetic emerges naturally from just two operators: Δ (distinction/branching) and Σ (connection/composition).

    This isn't just coding — it's evidence for the Δ–Σ Turing Completeness Theorem: a system is Turing-complete iff it can be represented through Δ and Σ.

    Code implements the proofs: github.com/muskin88/delta-sigm
    Formal statement: zenodo.org/records/17895986
    (Theorem 3)

    The implications are ontological: these operators appear inevitable for any non-trivial reality. The framework unites computation, mathematics, and fundamental ontology.

    #CategoryTheory #FoundationsOfMath #Computation #Ontology #FormalMethods #TypeTheory #PeanoArithmetic #TuringCompleteness #MathematicalPhilosophy

  25. We've computationally verified that Peano arithmetic emerges naturally from just two operators: Δ (distinction/branching) and Σ (connection/composition).

    This isn't just coding — it's evidence for the Δ–Σ Turing Completeness Theorem: a system is Turing-complete iff it can be represented through Δ and Σ.

    Code implements the proofs: github.com/muskin88/delta-sigm
    Formal statement: zenodo.org/records/17895986
    (Theorem 3)

    The implications are ontological: these operators appear inevitable for any non-trivial reality. The framework unites computation, mathematics, and fundamental ontology.

    #CategoryTheory #FoundationsOfMath #Computation #Ontology #FormalMethods #TypeTheory #PeanoArithmetic #TuringCompleteness #MathematicalPhilosophy

  26. We've computationally verified that Peano arithmetic emerges naturally from just two operators: Δ (distinction/branching) and Σ (connection/composition).

    This isn't just coding — it's evidence for the Δ–Σ Turing Completeness Theorem: a system is Turing-complete iff it can be represented through Δ and Σ.

    Code implements the proofs: github.com/muskin88/delta-sigm
    Formal statement: zenodo.org/records/17895986
    (Theorem 3)

    The implications are ontological: these operators appear inevitable for any non-trivial reality. The framework unites computation, mathematics, and fundamental ontology.

    #CategoryTheory #FoundationsOfMath #Computation #Ontology #FormalMethods #TypeTheory #PeanoArithmetic #TuringCompleteness #MathematicalPhilosophy

  27. We've computationally verified that Peano arithmetic emerges naturally from just two operators: Δ (distinction/branching) and Σ (connection/composition).

    This isn't just coding — it's evidence for the Δ–Σ Turing Completeness Theorem: a system is Turing-complete iff it can be represented through Δ and Σ.

    Code implements the proofs: github.com/muskin88/delta-sigm
    Formal statement: zenodo.org/records/17895986
    (Theorem 3)

    The implications are ontological: these operators appear inevitable for any non-trivial reality. The framework unites computation, mathematics, and fundamental ontology.

    #CategoryTheory #FoundationsOfMath #Computation #Ontology #FormalMethods #TypeTheory #PeanoArithmetic #TuringCompleteness #MathematicalPhilosophy