Radiance
Radiance is a simple language that compiles to WebAssembly. It's syntax has a familiar and modern style created by blending choice parts of Swift, Rust and TypeScript. By utilising static type checking it allows you to create safer and more concise code than JavaScript, without hindering you and providing easy integration with your existing JavaScript code.
It's design intention is to be intuative and easy to write, while making the most of what the WebAssembly format has to offer.
export fn factorial (count: i32) -> i32 { let result: i32 = 1; let i: i32 = 0 if count == 0 { 1 } else { while i < count { i = i + 1 result = result * i } }}Secondary goal
In part the syntax of this language was developed from the ideas of Let's stop copying C. The article is well worth a read and discusses multiple evils that C has inspired in other languages, depending on your point of view some of these may be more controvertial than others. Not based on C discusses our take on the article, and what changes this has effected on Radiance.
Learning the language
There's still a lot to be done on this language, such as the documentation! If you are reasonably technical then a good place to start at the moment is [src/parser/index.test.ts].
Status
Development is still in a fairly early stage, but the language is usable for certain forms of program. Many language features have been implemented, but some higher level features are still missing requiring users to fall back on older more verbose styles of programming. Below is the implementation status of our planned feature list:
Basic features
- Signed integer types ( i32, i64 )
- Unsigned integers
- Floating point types ( f32, f64 )
- Functions
- Logical operators ( not, and, or )
- Bitshift
- Bitwise operators ( and, or )
- Basic math operators ( +, -, *, /, % )
- Comparison operators ( ==, !=, <, >, <=, >= )
- Type casting ( as )
- While loop expressions
- If/else expressions
- Local variables
- Import host functions
- Export functions to host
- Break/Continue for loops
- Explicit function return
- Range literals
- For...of iterator loop
- Complex math operators ( sqrt, abs, ceil, floor, round, sign )
- Module system
Complex data types
- Structure
- Tuples
- Enumerations
- Arrays
- Strings
- Namespaces
- Methods
- Closures
- Generics
- Protocols
Compiler analysis
- Type inference
- Escape analysis
- Object scalar replacement
- Unused function removal
- Unused variable removal
Syntactic sugar
- Destructing assignment
Expression based
Inspired by Rust the majority of the language is expression based. There is no requirement for the ternary conditional expression, as the standard if syntax returns a value. Similarly while loops emit the result of their last iteration. A block will emit the value of the last expression within it. Functions behave much like blocks, meaning that no return statement is needed with fully described branches.
fn more_than_twelve (value: i32) -> i32 { if value > 12 { value } else { 0 }}Memory management
Currently Radiance uses a simple but effective system for allocating memory. This is to have a fast bump allocator that is cleared automatically at set intervals. Bump allocators require no header information for allocations and are very fast to allocate/free memory. The downside being that you can effectively only free everything at once, so you can end up with a lot of zombie data.
An example use case for this sort of allocator would be in a game, temporary resources can be allocated quickly using the bump allocator and then cleared at the end of each frame. Games often have strict time budgets for each frame, so simplifying the memory management time is a nice boon for developers.
WebAssembly works by exposing functions to a host, so Radiance clears the allocator when the host calls one of those functions. This occurs at the start of a call. Why the start you might wonder? This means that if the host wishes to read a value back from memory after a call it can do.
The advantage of this system is that the user does not have to do any explicit memory management. Creating an instance of a struct allocates the memory for it, and then when the current callstack is finished the memory is freed automatically. The downside is that the WebAssembly module has no persistence between calls... The solution to this is to have some form of heap which objects can be moved to. How this occurs has yet to be decided, but there are some ideas in the works.
There is one addition to this behaviour which is not immediately obvious. WebAssembly modules can call imported host functions, which can in turn then call the module again. So to prevent memory being cleared in this situation a depth counter is used to decide if the module has been entered recursively.
Now it's important to note this isn't a flawless system, it's possible that an individual function call could allocate a very large amount of memory in a loop, leading to large amounts of zombie data that could be cleared. It's possible to reduce this through improved code analysis during compilation. But importantly this current system meets the initial use case for this language. Which is for set of medium sized functions exposed to the host, which the host calls into. This all may change in the future!