AMA about languages, types, etc.
(Same lack of guarantee, but I’ll consider this an interesting challenge to see what I can explain effectively.) twitter.com/typeswitch/sta
Conversation
Replying to
Any thoughts on using graph-style data structures (as opposed to trees) for representing programming languages? This is something I have been pondering recently.
Replying to
I do this just about exclusively, tho usually via implicit sharing in Haskell—let-binding a value and then substituting it in for occurrences of the same value ends up making a graph with edges to the shared let-bound node.
Haven’t tried it with explicit sharing but worth a shot
1
1
Yeah, guess I've been wondering about maybe evaluating into a semantic domain based on graphs but I dunno if that is a weird/silly idea. I want to be able to easily compare dependent records/modules/parameters without forcing a specific order, and more caring about dependencies.
1
1
1
Show replies