In a lot of the ways people use dictionaries/maps/hashtables, there's a type dependency between the keys and values, but most mainstream typed languages provide homogeneously-typed maps. Are there any that try to preserve more interesting type relationships between key and value?
Conversation
Replying to
Everyone wants row polymorphism, but when can I get something like "graph polymorphism". Ie. dependent row types that I can smoosh together and not worry about ordering unless I want to fix things in a specific order for low-level data layout purposes.
Thinking about
Quote Tweet
Also found the observation that the order in which the rules for dependent pairs and dependent functions are defined shouldn't really matter (44:56) interesting too. Links in with some of the graph/module stuff I've been pondering recently…
Show this thread
1
1
And also
Quote Tweet
Replying to @rob_rix
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.