Blocks and statements

A block is an expression that has the general form:


A block can have zero or more statements, and the value of the whole block is the value of the finalexpression.A statement is either:

  1. Aterm definitionwhich defines a term within the scope of the block. The definition is not visible outside this scope, and is bound to a local name. Unlike top-level definitions, a block-level definition does not result in a hash, and cannot be referenced with ahash literal.
  2. AUnison expression.In particular, blocks often containaction expressions,which are expressions evaluated solely for their effects. An action expression has type{A} Tfor some abilityA(seeAbilities and Ability Handlers)and some typeT.
  3. Auseclause.

An example of a block:

use Nat + x = 4 y = x + 2 f y a = a + y f y 10

A number of language constructs introduce blocks. These are detailed in the relevant sections of this reference. Wherever Unison expects an expression, a block can be introduced with theletkeyword:

let <block>

Where<block>denotes a block as described above.

The lexical syntax of blocks

The standard syntax expects statements to appear in a line-oriented layout, where whitespace is significant.

The opening keyword (''let'',if,then,orelse,for example) introduces the block, and the position of the first character of the first statement in the block determines the top-left corner of the block. The beginning of each statement in the block must be lined up exactly with the left edge of the block. The first non-whitespace character that appears to the left of that edge (i.e. outdented) ends the block. Certain keywords also end blocks. For example,thenends the block introduced byif.

A statement or expression in a block can continue for more than one line as long as each line of the statement is indented further than the first character of the statement or expression.

For example, these are valid indentations for a block:

  x = 1
  y = 2
  x + y

let x = 1
    y = 2
    x + y

Whereas these are incorrect:

let x = 1
  y = 2
  x + y

let x = 1
     y = 2
       x + y

Syntactic precedence

Keywords that introduce blocks bind more tightly thanfunction application.Sof let xis the same asf (let x)andf if b then p else qis the same asf (if b then p else q).

Block keywords bind more tightly thandelayed computationssyntax. So'let x''is the same as_ -> let xand!if b then p else qis the same as(if b then p else q) ().

Blocks eagerly consume expressions, soif b then p else q + ris the same asif b then p else (q + r).