For skies of couple-colour as a brinded cow;

The product manager posting implies they have something called a "Brick Foundation model"?

references on Arrows (I don't know them well myself)

API docs hackage.haskell.org/package/base...

original paper www.cse.chalmers.se/~rjmh/Papers...

websites that look like they're written by someone who knows what they're talking about www.haskell.org/arrows/ en.wikibooks.org/wiki/Haskell...

I posted this question over on fediverse: recurse.social/@rntz/115442..., although I'm not sure I summarized it the way you would've :)

so far someone has suggested that Haskell's "Arrows" might be what you're looking for? recurse.social/@typeswitch@...

how can we find time to explain things?
good talks are so good, so valuable.
(... can we review them like we review papers?)

exactly! the table stores only the inputs mapping to non-nil.

without the nil value I can't define what finite support is. or am I misunderstanding the question?

(the slides are probably not self-explanatory without the talk, but I thought I'd throw them up anyway...)

bsky.app/profile/did:...

no, we're all at the workshops at NUS School of Computing

join ussssss

I wasn't thinking of synthetic functions, but of synthetic values. Eg. the delta(0) = infty, delta(x) = 0 otherwise, where "infty" is a synthetic value such that integrating over it yields 1. So infty is like the opposite of an infinitesimal. Indeed, perhaps infty = 1 / epsilon?

just a bit onward Hansen cites Dijkstra 1971b, "Hierarchical Ordering of Sequential Processes", which invokes a fairness property ("each process... is guaranteed to proceed with some unknown, but finite speed") but reserves the actual term "fair" only for a much stronger property