Future of Coding is an online community with a welcoming, cooperative, and revolutionary spirit. We are unified in the belief that the common practice of programming is tragically less humane than it could be.

Future of Coding

<https://twitter.com/emi1ypi/status/1165348474990321665?s=21>

And we get a good way of representing intermediate inconsistent states?

I don't know about `where pattern matches are generated by admissible prisms of sums` but the rest sounds like clojure

check out zip-visit: <https://github.com/akhudek/zip-visit>
I have used it effectively with core.match (pattern-matching, non-exhaustive) for tree-transformation

there's also this neat library that tries to unify different queries and mutations across native data structures: <https://github.com/redplanetlabs/specter#specter->