But they can’t have recursive layout, as & I learned today. Crashy crash.
Conversation
Oh. Yes. For sure. What would you like that to mean?
1
I want impl. details like by-value and by-ref to vanish from the lang.
3
2
Ehhhhhhhhh. And I want C-like performance characteristics. ¯\ _(ツ)_/¯
2
2
And you’ll have them—it knows when it will copy more than it will ref.
2
2
2
by def’n it can see every point at which a by-value type is copied, which is equivalent to the ref points for by-ref.
1
(I am making the simplifying assumption that identity is solved by magical hand-waving)
2
Pass-by-value means a different thing than pass-by-ref. It makes a copy each time. Sometimes you want a copy; sometimes you don't.
1
right, but assume the language can assign either semantic to any particular pass.
1
Replying to
How does the language know which the caller means?
Replying to
it *decides* which the caller means. Like I said, identity is hand-waved away. Aside from that it’s optimization.
1
*squiiiiiiint* I don't see how you can hand wave identity away
1
1
Show replies
Replying to
Basically, I take the viewpoint that the existence of the stack is an implementation detail.