drim/README.md

137 lines
5.8 KiB
Markdown
Raw Normal View History

2022-07-31 12:57:22 -05:00
<!--
Please keep this document correctly word-wrapped at 70 columns and
with no trailing whitespace or blank lines at the end! Merge requests
with modifications to this document will be not be accepted until it
is formatted correctly! ~~abb
-->
# AlexScript
2022-08-10 13:17:16 -05:00
AlexScript is a programming language designed to have the very
high-level ergonomics and provable correctness of a purely functional
language, while maintaining speed using strictly-controlled,
2022-08-04 18:16:33 -05:00
deterministic memory management. The language is capable of compiling
to C (and possibly other languages in the future), allowing for
maximum portability without having to write a new backend for the
compiler for every possible target; also, the compiler and tooling
will eventually be rewritten in AlexScript to allow for maximum
portability.
2022-08-10 13:17:16 -05:00
Syntactically, the language primarily resembles a mixture between
standard ML and Rust; the language always ignores whitespace.
AlexScript is a misnomer; the language is not actually a scripting
language and will probably be renamed in the near future.
2022-08-04 18:16:33 -05:00
## Example
```
// Calculates the nth fibonacci number.
2022-08-10 13:17:16 -05:00
def fibonacci (n: U32) : U32 = match n {
0 => 0,
1 => 1,
n => fibonacci (n - 2) + fibonacci (n - 1),
};
2022-08-04 18:16:33 -05:00
// Prompts the user for a number n, and prints the Fibonacci numbers up
// to n.
2022-08-10 13:17:16 -05:00
def fibPrompt = do {
print "Enter a number: ";
num <- read <$> getLine;
sequence_ (print . fibonacci <$> (0 .. num));
};
2022-08-04 18:16:33 -05:00
// Program entry point.
2022-08-10 13:17:16 -05:00
def main : IO ()
2022-08-04 18:16:33 -05:00
= fibPrompt;
```
Note that type annotations are always optional; here they're given for
`fibonacci` and `main` for illustrative purposes, but omitted for
`fibPrompt` (for which the compiler infers the return type `IO ()`).
2022-07-31 12:57:22 -05:00
## Tools
2022-08-02 22:16:16 -05:00
This repository contains the following tools:
2022-08-10 13:17:16 -05:00
- `axc-rs`, the Stage-1 AlexScript compiler, written in Rust. This can
be used as a binary with a fairly standard compiler CLI, or as a
library for use in other Rust programs.
2022-08-02 22:16:16 -05:00
The following tools do not exist yet, but are planned:
2022-08-10 13:17:16 -05:00
- `axc`, the main AlexScript compiler written in AlexScript. This
program supports a superset of the behavior of `axc-rs`, and exposes
a library that can be used by other AlexScript programs in addition
to a the compiler CLI.
- `axci`, the interactive AlexScript interpreter, a wrapper around
`axc`.
2022-07-31 12:57:22 -05:00
- `axcd`, the Language Server Protocol (LSP) server for AlexScript
code support in editors, supporting definition peeking and lookup,
2022-08-02 22:16:16 -05:00
renaming variables and modules, etc.
2022-07-31 12:57:22 -05:00
- `axfmt`, the standard formatter for AlexScript code; all AlexScript
code used in this repository must be formatted with `axfmt`, and its
2022-08-02 22:16:16 -05:00
use is recommended for other projects.
- `axdoc`, the documentation generator.
2022-07-31 12:57:22 -05:00
- `alexscript-mode`, an Emacs mode for editing AlexScript code,
supporting syntax highlighting, automatic indentation, some basic
keybindings for common tasks, Emacs-side LSP integration for
communicating with `acxd`, and a collection of `yasnippet` snippets
2022-08-02 22:16:16 -05:00
for inserting common AlexScript constructs.
2022-07-31 12:57:22 -05:00
- `alexscript-vsc`, Visual Studio Code plugins and tools for editing
2022-08-02 22:16:16 -05:00
AlexScript code.
2022-07-31 12:57:22 -05:00
- `alexscript-vim`, tools and configuration files for optimizing Vim
2022-08-02 22:16:16 -05:00
and Neovim for editing AlexScript code.
## Language features
The language is mostly influenced by Rust and Haskell: it has strict
safety requirements and borrow-checked memory management like that of
Rust, but its syntax and type system are similar to those of Haskell.
Some features the language will most likely have:
- All functions are pure by default; side effects are chained together
using an `IO` monad.
- Despite the language's purity, expressions will be strictly
evaluated to provide more programmer control.
- Different monads represent different levels of safety, and can be
converted using functions marked as `UNSAFE`. The intention is that
code can be audited by manually checking that all the `UNSAFE`
transformations are sound, and code that contains no `UNSAFE`
function calls are guaranteed to satisfy varying definitions of
soundness:
- The `IO` monad represents computations that might have side
effects on the real world. If a computation of type `IO` is known
by the programmer to not have side effects on the real world, then
it can be converted to a pure computation using the standard
library function `UNSAFE_assertPure : IO a -> a`.
- The `MemoryUnsafe` monad represents computations that might read
from or write to memory that is not allocated correctly: for
example, `readPtr`, which reads from a raw pointer, is of type
`MemoryUnsafe a` because the pointer is not known to be valid. If
a computation has been confirmed to be safe by the programmer, it
can be converted to an `IO` computation using
`UNSAFE_assertMemorySafe : MemoryUnsafe a -> IO a`.
- Further safety monads may be added in the future.
2022-08-04 18:16:33 -05:00
- The language achieves good performance by guaranteeing a number of
optimizations:
- Since the language uses a linear type system, garbage collection
is not done; instead, values are stored on the stack unless
explicitly declared to be on the heap, and heap-stored values are
cleaned up at deterministic points as calculated at compile time.
- Functions of type `Fn t -> t` are optimized into functions that
operate on pointers to `t`, i.e., notionally, `Fn (*mut t) -> ()`,
where `*mut t` is a mutable pointer to a type `t`.
- Types that contain an optional, non-null pointer like `Option (Box
a)`, `Option (Ref a)`, etc., are optimized into nullable pointers.
- Since the language has no loops, the compiler guarantees
optimization of tail-call recursion to loops on all functions, as
is standard in functional languages.
2022-08-02 22:16:16 -05:00
## Compilation
2022-08-04 18:16:33 -05:00
When invoked with no flags, AlexScript by default compiles source code
directly to code that is valid C and C++, then calls the system C
compiler to generate an object file, then calls the system linker to
generate an executable file.