julesh

@julesh.mathstodon.xyz.ap.brid.gy

Applied Compositional Thinking 🌉 bridged from ⁂ https://mathstodon.xyz/@julesh, follow @ap.brid.gy to interact

Functors Lens → Set are the same thing as strong profunctors Setᵒᵖ x Set → Set (the Tambara representation theorem), so "dependent strong profunctors" on Set can probably be usefully *defined* to be functors Poly → Set

I guess the same feature of Javascript that we used in the 90s to get cute animations following the mouse pointer is what is now used to biometrically fingerprint your hand movements on every webpage

I might have to write a blog post building up an explanation of this little bit of code. This is a way of handling mutable local state in lenses, using (1) an old Lisp trick called for simulating OOP, and (2) the fact that categories are comonoids of the composition product of polynomial functors

new : Category s -> State s -> Costate (Tensor s a) -> IO (Costate (Lift IO a))
new (MkCategory _ cod _) init f = do
  ref <- newIORef (init ()).fst
  pure $ \x => (() ** \_ => do
    current <- readIORef ref
    let (() ** k) = f (current, x)
    let (delta, y) = k ()
    writeIORef ref (cod current delta)
    pure y)

"Average tech salary is high" factoid statistically false. Senior Machine Learning Engineer Georg, who lives in a cave and has a salary of 1,000,000 per year, is a statistical outlier adn should not have been counted