One of these days I want to give a compiler talk called "name lookup is the absolute worst" that's just 100 slides of screaming goat memes.
Conversation
As a counter-point, what language(s) would you say have "good" name lookup rules, where "good" ?= easy and convenient for the programmer as well as the implementer?
1
Possibly Forth. Or APL or something. Combinatory forms rather than binding forms.
2
5
Name binding is so frustrating arrrgh
1
1
I even made a thing for this, but it's slowww github.com/brendanzab/mon - was thinking of going nominal and using visitors like in Visitors Unchained… that way I can fuse traversals together… but apparently you pay for it in other ways. 😭
3
2
2
Eelco Visser's scope graphs are also kinda neat, but I've not studied them too closely yet! eelcovisser.org
2
1
(Is... the actual paper available anywhere? Everything just links to the conference talk page which doesn't seem to have it, and the artifact github repo has a DOI link which is dead.)
1
1
Oh, I think I have that one in my to-read list already... :) lmk if you happen to see "Scopes as Types" anywhere, that sounds quite interesting also.
1
1
Yeah - I just want this kind of thing to work for me in a dependently typed setting! Not sure if they've tackled that yet. 🤔
1