Renderingen-US

Experimental through version 1. Version 0 was alpha. This is the first language release: the interface is relatively stable, not frozen. Nothing is promised stable until version 2.

Expressions & operators

Keyword spelling

An expression produces a value. This family is the operator stack: assignment at the root, then or and and, then comparison and arithmetic, then calls, members, and the literals — numbers, strings, true / false / null, lists, tuples, and inline JSON.

← stores a value at run time. and / or / not are the boolean words. coalesce is the nullish default: if the left side is null, the value is the right side. A "…" literal with § holes is a template; the parentheses after it supply the arguments, which is not a function call.

fn greet(string nomen) → string {
    return "Salve, §!"(nomen)
}

main {
    let i32 a ← 7
    let i32 b ← 2
    print a / b
    print a ≥ b and b ≢ 0
    print greet("munde")
}

coalesce fills in a missing value:

main {
    let i32 ∪ none missing ← null
    let i32 n ← missing coalesce 0
    print n
}

Return to the grammar overview.

Terms#

These are the words you write in this part of the language. Each links to its page. The second column names the grammar rule the word belongs to.

TermGrammar rule
oraut_expr
andet_expr
is, is, notequality_tail
before, step, untilrange_tail
coalescevel_expr
before, step, untilvel_range_tail
notunary_expr
spreadargument
ref, mutcall_marker
spreadtemplate_argument
false, null, trueliteral
selfprimary
callad_expr
tupleiuncta_expr
fromconstruction_source
variantfinge_expr
comptimepraefixum_expr
formatscriptum_expr
read, linelege_expr
fromreducta_expr
all, sumreducta_op
perreducta_group
let, mutreducta_body
coalescereducta_identity
from, letscan_expr
all, sumscan_op
perscan_group
ref, fromsort_expr
let, mutsort_body

Formal grammar#

The rules for this part of the language are the parser's own definition of it. They are written for models and tools, so this page does not repeat them; the full list is at every production.