←back to thread

Tree Borrows

(plf.inf.ethz.ch)
565 points zdw | 2 comments | | HN request time: 0.443s | source
Show context
fuhsnn ◴[] No.44512042[source]
I wonder if Rust or future PL would evolve into allowing multiple borrow checker implementations with varying characteristics (compile speed, runtime speed, algorithm flexibility, etc.) that projects can choose from.
replies(9): >>44512293 #>>44512361 #>>44512426 #>>44512597 #>>44512841 #>>44513554 #>>44513949 #>>44516880 #>>44516995 #
1. speed_spread ◴[] No.44512293[source]
I cannot imagine how that would work. You couldn't combine code that expect different borrowing rules to be applied. You'd effectively be creating as many sub-dialects as there are borrow checker implementations.
replies(1): >>44512982 #
2. vlovich123 ◴[] No.44512982[source]
FWIW technically the rules are the same. How they go about proving that the rules are upheld for a program is what would be different.