Doc language FAQ

General language issues

I'm impatient. Can you give a brief summary of the salient features?

Safety oriented:

• Memory safe. No null pointers, wild pointers, etc. Automatic storage management.
• Mutability control. Immutable by default. No shared mutable state across tasks.
• Dynamic execution safety: task failure / unwinding, trapping, logging. RAII / dtors.
• Typestate system: ability to define complex invariants that hold over data structures.

Concurrency and efficiency oriented:

• Explicit memory control. Layout and allocation control. Interior / value types.
• Very lightweight tasks (coroutines). Cheap to spawn thousands-to-millions.
• Static, native compilation. Uses LLVM, including its optimization passes. Emits ELF / PE / Mach-O files.
• Direct and simple interface to C code.

Practicality oriented:

• Multi-paradigm. Pure-functional, concurrent-actor, imperative-procedural, OO.
• First-class functions, cheap non-escaping closures.
• Structural and nominal types.
• Memory isolation for concurrent tasks, cheap tasks with expanding stacks, async message passing.
• Typeclass-like interfaces and implementations, "method" definitions on any type.
• Multi-platform. Developed on Windows, Linux, OS X.
• UTF-8 strings, assortment of machine-level types.
• Works with existing native toolchains. GDB / Valgrind / Instruments / etc.
• Practical rule-breaking: can break safety rules, if explicit about where and how.

What does it look like?

The syntax is still evolving, but here's a snippet from cargo, the Rust package manager:

fn install_source(c: cargo, path: str) {
    #debug("source: %s", path);
    fs::change_dir(path);
    let contents = fs::list_dir(".");

    #debug("contents: %s", str::connect(contents, ", "));

    let cratefiles = vec::filter(contents) { |n|
        str::ends_with(n, ".rc")
    };

    if vec::is_empty(cratefiles) {
        fail "This doesn't look like a rust package (no .rc files).";
    }

    for cf in cratefiles {
        let p = load_pkg(cf);
        alt p {
            none. { cont; }
            some(_p) {
                install_one_crate(c, path, cf, _p);
            }
        }
    }
}

Does it run on Windows?

Yes. All development happens in lock-step on all 3 target platforms. Using mingw, not cygwin.

Are there any big programs written in it yet? I want to read big samples.

The Rust compiler, 40,000+ lines at the time of writing, is written in Rust. See the src/comp/ directory.

Have you seen this Google language, Go? How does Rust compare?

Yes.

• Rust development was several years underway before Go launched, no direct inspiration.
• Though Pike's previous languages in the Go family (Newsqueak, Alef, Limbo) were influential.
• Go adopted semantics (safety and memory model) that are quite unsatisfactory.
• Shared mutable state.
• Global GC.
• Null pointers.
• No RAII or destructors.
• No type-parametric user code.
• There are a number of other fine coroutine / actor languages in development presently. It's an area of focus across the PL community.

I like the language but it really needs $somefeature.

At this point we are focusing on removing and stabilizing features rather than adding them. File a bug if you think it's important in terms of meeting the existing goals or making the language passably usable. Reductions are more interesting than additions though.

Specific language issues

Is it OO? How do I do this thing I normally do in an OO language?

It is multi-paradigm. Not everything is shoe-horned into a single abstraction. Many things you can do in OO languages you can do in Rust, but not everything, and not always using the same abstraction you're accustomed to.

How do you get away with "no null pointers"?

Data values in the language can only be constructed through a fixed set of initializer forms. Each of those forms requires that its inputs already be initialized. A dataflow analysis (the typestate system used elsewhere) ensures that local variables are initialized before use.

What is the relationship between a module and a crate?

• A crate is a top-level compilation unit that corresponds to a single loadable object.
• A module is a (possibly nested) unit of name-management inside a crate.
• A crate contains an implicit, un-named top-level module.
• Recursive definitions can span modules, but not crates.
• Crates do not have global names, only a set of non-unique metadata tags.
• There is no global inter-crate namespace; all name management occurs within a crate.
• Using another crate binds the root of its namespace into the user's namespace.

Why is failure unwinding non-recoverable within a task? Why not try to "catch exceptions"?

In short, because too few guarantees could be statically made about the dynamic environment of the catch block to be able to safely resume.

In more detail: the origin-state of a failure is unknown by definition, therefore catching it would result in dropping the static typestate of the "catch block" to the lowest initialization typestate in the containing block, as well as dropping all user-defined conditions at any statements in the task. The set of operations that would be legal to perform in such a catch block would be minimal at a local level, and intractable at a task level: there would be no way to tell how much of the typestate assumed by the caller of the catch -- or any other functions in the task -- still holds. This sort of "resume in an arbitrarily damaged state" construct would defeat most of the other static rules in the language.

Rust provides, instead, three predictable and well-defined options for handling any combination of the three main categories of "catch" logic:

• Failure logging is done by the integrated note statement.
• Recovery after a failure is done by trapping a task failure from outside the task, where the typestate of other tasks is known to be unaffected.
• Cleanup of resources is done by RAII-style objects with destructors.

Cleanup through RAII-style destructors is more likely to work than in catch blocks anyways, since it will be better tested (part of the non-error control paths, so executed all the time).

Why aren't modules type-parametric?

Doing so would likely require that type-parametric code is statically expanded, duplicating code. It would also require a complex mechanism inside crates for maintaining uninstantiated module-bodies. While this is a possible implementation approach for parametric code, we don't want to mandate it. We want to maintain the option to parametrize at runtime (this is the default implementation).

Why aren't values type-parametric? Why only items?

Doing so would make type inference much more complex, and require the implementation strategy of runtime parametrization. While this is our default implementation strategy, we don't want to mandate it.

Why are enumerations nominal and closed?

We don't know if there's an obvious, easy, efficient, stock-textbook way of supporting open or structural disjoint unions. We prefer to stick to language features that have an obvious and well-explored semantics.

Why aren't channels synchronous?

There's a lot of debate on this topic; it's easy to find a proponent of default-sync or default-async communication, and there are good reasons for either. Our choice rests on the following arguments:

• Part of the point of isolating tasks is to decouple tasks from one another, such that assumptions in one task do not cause undue constraints (or bugs, if violated!) in another. Temporal coupling is as real as any other kind; async-by-default relaxes the default case to only causal coupling.
• Default-async supports buffering and batching communication, reducing the frequency and severity of task-switching and inter-task / inter-domain synchronization.
• Default-async with transmittable channels is the lowest-level building block on which more-complex synchronization topologies and strategies can be built; it is not clear to us that the majority of cases fit the 2-party full-synchronization pattern rather than some more complex multi-party or multi-stage scenario. We did not want to force all programs to pay for wiring the former assumption in to all communications.

Why are channels half-duplex (one-way)?

Similar to the reasoning about default-sync: it wires fewer assumptions into the implementation, that would have to be paid by all use-cases even if they actually require a more complex communication topology.

Why are channels weak?

To simplify reasoning about resource-ownership and task-lifetime reasoning. This decision may be revisited in the future.

Why are strings UTF-8 by default? Why not UCS2 or UCS4?

The str type is UTF-8 because we observe more text in the wild in this encoding -- particularly in network transmissions, which are endian-agnostic -- and we think it's best that the default treatment of I/O not involve having to recode codepoints in each direction.

This does mean that indexed access to a Unicode codepoint inside a str value is an O(n) operation. On the one hand, this is clearly undesirable; on the other hand, this problem is full of trade-offs and we'd like to point a few important qualifications:

• Scanning a str for ASCII-range codepoints can still be done safely octet-at-a-time, with each indexing operation pulling out a u8 costing only O(1) and producing a value that can be cast and compared to an ASCII-range char. So if you're (say) line-breaking on '\n', octet-based treatment still works. UTF8 was well-designed this way.
• Most "character oriented" operations on text only work under very restricted language assumptions sets such as "ASCII-range codepoints only". Outside ASCII-range, you tend to have to use a complex (non-constant-time) algorithm for determining linguistic-unit (glyph, word, paragraph) boundaries anyways. We recommend using an "honest" linguistically-aware, Unicode-approved algorithm.
• The char type is UCS4. If you honestly need to do a codepoint-at-a-time algorithm, it's trivial to write a type wstr = vec[char], and unpack a str into it in a single pass, then work with the wstr. In other words: the fact that the language is not "decoding to UCS4 by default" shouldn't stop you from decoding (or re-encoding any other way) if you need to work with that encoding.

Why is log an expression rather than library function?

We wish to integrate logging with the language at multiple levels: in terms of filtering by module path and task, with type-specific logging variants, with lazy evaluation of the arguments such that inactive logging statements are very cheap, and also integrated with the note expression for logging during failure. It's possible we could replicate these features via a mixture of compiler-provided hooks, syntax-extensions and library calls, but it's neither clear that this would be possible nor whether the interface would be syntactically cumbersome: the best logging, after all, is the kind that's light enough that you regularly use it!

If someone manages to cook up a useful version that seems light and usable and hits all the same use-cases, without requiring a dedicated statement, we'll consider replacing it.

Why are strings, vectors etc. built-in types rather than (say) special kinds of iface/impl?

In each case there is one or more operator, literal constructor, overloaded use or integration with a built-in control structure that makes us think it would be awkward to phrase the type in terms of more-general type constructors. Same as, say, with numbers! But this is partly an aesthetic call and, similarly to with the log expression, we'd be willing to look at a worked-out proposal for eliminating or rephrasing these special cases.

Can Rust code call C code?

Yes. Since C code typically expects a larger stack than Rust code does, the stack may grow before the call. The Rust domain owning the task that makes the call will block for the duration of the call, so if the call is likely to be long-lasting, you should consider putting the task in its own domain (thread or process).

Can C code call Rust code?

Not directly. We expect to develop a mechanism for C code to transmit messages into Rust channels, but a direct call would not make much sense since all Rust code runs in a task -- which may deschedule and switch to another task mid-call -- whereas C code does not, and will not behave well if "switched away" from.

How do Rust's task stacks work?

They start very small (a few hundred bytes) and expand dynamically by calling through special frames that allocate new stack segments. This is known as the "spaghetti stack" approach.

What is the difference between a reference and a box pointer?

• A box pointer points into a reference-counted heap allocation.
• A reference points to the interior of a stack or heap allocation, and formation or duplication of an alias does not entail reference counting.
• References can only be formed when the referent will provably outlive the reference.
• References can therefore only be declared in function signatures, as parameters.

Why aren't function signatures inferred? Why only local slots?

• Mechanically, it simplifies the inference algorithm; inference only requires looking at one function at a time.
• The same simplification goes double for human readers. A reader does not need an IDE running an inference algorithm across an entire crate to be able to guess at a function's argument types; it's always explicit and nearby.
• Parameters in Rust can be passed by reference or by value. We can't automatically infer which one the programmer means.

Why isn't let i: uint = 0 valid Rust?

Rust provides no coercion or overloading for literals so the 0 is always type int. To create a uint the literal must be suffixed with u. Implicit conversions are a common source of errors in C-like languages, so there is a strong desire to not let such problems creep into the language. That said, this is feature is often frustrating, so a limited form of literal overloading may be introduced in the future.