Conversation

Can e-graphs be done fast? I looked at them a bit but it seemed they were taking a pretty slow approach to name binding/substitution. Would be cool to figure out how to get e-graphs to work with the semantic type checking stuff - is that possible at all?
2
2
You’re unable to view this Tweet because this account owner limits who can view their Tweets. Learn more
You’re unable to view this Tweet because this account owner limits who can view their Tweets. Learn more
You’re unable to view this Tweet because this account owner limits who can view their Tweets. Learn more
Yeah, that's the work I thought was being talked about - I was looking at the implementation and trying to understand it, but was a bit discouraged by the approach to substitution. Was hoping there might be a way to get around this… :(
1
So it seems like it _might_ be possible to integrate it into a semantic type checker – I haven't tried it yet though, but it could be fun to have a go at some stage!
1