~/talk

Live-coding with Universal Constructions

slides:none on file

Claim: universal constructions from category theory translate directly into runnable code, and diagrams yield concrete implementations. Live-coding translates Haskell diagrams into Scala (by composing projections and injections) to build a tiny library implementing product fanout/fanin, either/case, bimap and the distributivity map A×C + B×C → (A+B)×C. The Scala compiler needs occasional type annotations; type inference hiccups occur but code runs. Surprising result: deriving the distributivity and a point‑free implementation is easier from the universal diagrams than by ad hoc composition.

AI-written summary · about

  1. 0:00Introduction
  2. 3:13Category theory philosophy
  3. 10:15Product types
  4. 20:53Product properties
  5. 25:32Functoriality of products
  6. 34:21Sum types (Either)
  7. 43:44Proving distributive law
  8. 50:04Conclusion
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.