Sunjay Varma

# Name Mangling Scheme The hash values below are made up, but should eventually come from some decent algorithm for [short hashes](https://stackoverflow.com/questions/4567089/hash-function-that-produces-short-hashes). 1. **package/module** * Fully qualified name of module...

Even simpler scheme that just uses the length and not a hash: https://rust-lang.github.io/rfcs/2603-symbol-name-mangling-v2.html#the-mangling-scheme-by-example

Idea: Whenever we try to resolve a method we don't know the type for, we can add a new "method constraint" to a list. Each method constraint contains the method...

## Backtracking Search for Unit Conversion This is probably a very slow but correct algorithm. This might be a good place to start implementing, and also a place to start...

Cases that make this a complex problem: * 1 J == 1 N m * 1 N = kg m s^-2 * Etc

Sub problem: * Suppose you have a unit a^e1 b^e2 c^e3 ... * Find all combinations of one of more parts of this unit that exist in the unit conversion...

The same program but with operators added in. ```rust //! A dino program that reads a line of text as input, sorts it, and then outputs the //! sorted string....

Would it be possible to add a way to just disable the autocomplete then? I find deleting the extra `>` more annoying than having to type it.

The basic scaffolding for optimizations has been implemented. More optimizations will be added as time goes on and more features are added to the language. This issues tracks the progress...

No whitespace (other than newlines) is significant. ```rust // Syntax: // @x = address x // 'y: = label y // @x[n] = perform pointer arithmetic (n must be a...