Conversation

Any thoughts on using graph-style data structures (as opposed to trees) for representing programming languages? This is something I have been pondering recently.
1
3
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
Yeah, curious about the relationship between parameters and fields. Parameters are things you 'assume', and fields are things you 'have'. Application is turning an assumption into something you have. Or something like that?
2
1