Rue: Higher level than Rust, lower level than Go
1–10 of 274 posts
Re: Rue: Higher level than Rust, lower level than Go
#2> No garbage collector, no manual memory management. A work in progress, though.
I couldn't find an explanation in the docs or elsewhere how Rue approaches this.
If not GC, is it via:
a) ARC
b) Ownership (ala Rust)
c) some other way?
Re: Rue: Higher level than Rust, lower level than Go
#3Re: Rue: Higher level than Rust, lower level than Go
#4> Memory Safe > No garbage collector, no manual memory management. A work in progress, though. I couldn't find an explanation in the docs or elsewhere how Rue approaches this. If not GC, is it via: a) ARC b) Ownership (ala Rust) c) some other way?
Re: Rue: Higher level than Rust, lower level than Go
#5> Memory Safe > No garbage collector, no manual memory management. A work in progress, though. I couldn't find an explanation in the docs or elsewhere how Rue approaches this. If not GC, is it via: a) ARC b) Ownership (ala Rust) c) some other way?
Re: Rue: Higher level than Rust, lower level than Go
#6> Memory Safe > No garbage collector, no manual memory management. A work in progress, though. I couldn't find an explanation in the docs or elsewhere how Rue approaches this. If not GC, is it via: a) ARC b) Ownership (ala Rust) c) some other way?
I am playing around with this! I'm mostly interested in something in the space of linear types + mutable value semantics.
Do you see this as a prototype language, or as something that might evolve into something production grade? What space do you see it fitting into, if so?
You've been such a huge presence in the Rust space. What lessons do you think Rue will take, and where will it depart?
I see compile times as a feature - that's certainly nice to see.
Re: Rue: Higher level than Rust, lower level than Go
#7Re: Rue: Higher level than Rust, lower level than Go
#8Re: Rue: Higher level than Rust, lower level than Go
#9I wince every time I see naive recursive fibonacci as a code example. It is a major turnoff because it hints at a lack of experience with tail call optimization, which I consider a must have for a serious language.
Re: Rue: Higher level than Rust, lower level than Go
#10I wince every time I see naive recursive fibonacci as a code example. It is a major turnoff because it hints at a lack of experience with tail call optimization, which I consider a must have for a serious language.