It can.
-Z unstable-options -Zunpretty=hir,typed
// source
pub fn square(num: i32) -> i32 {
num * num
}
// expanded
use ::std::prelude::v1::*;
extern crate std;
pub fn square(num: i32)
-> i32 ({ ((num as i32) * (num as i32) as i32) } as i32)
Re:The rise of wgpu
by steveklabnik on Thursday March 07, 2019 @01:07PM
(#19330420)
Oh dang! That's very cool, thank you!
Re:The rise of wgpu
by jonathanyc on Thursday March 07, 2019 @01:05PM
(#19330396)
I don’t think it’s just “strong” inference that’s the problem; I find I have an easier time reading ML because the inference somehow feels more obvious. After thinking about it some more, I think it really is deref coercion that is the gotcha, especially with function chaining.
Re:The rise of wgpu
by steveklabnik on Thursday March 07, 2019 @01:08PM
(#19330429)
By "strong" I really mean "type inference" over "type deduction", to be clear. But yeah, I could see that.
I tend to find, personally, that this kind of thing doesn't interfere strongly with reviewing. I think this is because I have an extensive background in dynamically typed languages and ones with strong inference like Rust, so I'm more used to it, whereas people who don't come from said backgrounds prefer more explicitness. YMMV of course!