I recently came across the Unison programming language. Their “big idea” of Unison is hashing every definition and syntax tree. This seemed reminiscent of something Joe Armstrong mentioned in a talk about doing away with URLs and so forth. I can’t remember which talk it was exactly. If anyone else knows which talk that was I’d like to rewatch it to see if there’s any real connection.
Unison appears to lean heavily on Haskell, but I wonder if this approach is something that BEAM languages might leverage as well.
