Functions in langur are pure in that they are not allowed to set values outside of their boundaries. They could still have "side effects," such as using writeln().

Functions are first-order. Both user-defined functions and built-in functions can be passed around as values.

The f token designates a function definition.

Functions may be defined with explicit parameters, no parameters, or implied parameters, or as operator implied functions, as shown in the examples below.

f(.x, .y) { .x + .y } # 2 explicit parameters f() { .x + .y } # no parameters (closure on 2 values) f { .x + .y } # 2 implied parameters f{+} # operator implied function

Curly braces are not required for a function declaration if the function body is a single statement (except for operator implied functions). I suppose this could be called a lambda. The example that follows also uses implied parameters.

f .x + .y

Operator implied functions are available as of 0.6.6. They are defined with 4 tokens with no spacing, using an infix operator, such as f{x}. This is the same as writing f .x x .y.

By default, function parameters are immutable.

To make a set of parameters mutable, precede the parameter names with a var token within the parameter list (possible as of 0.6.1). To make the rest of the parameters immutable, precede the names with a val token.

f(.x, .y) ... # .x and .y immutable

f(var .x, .y) ... # .x and .y mutable

f(var .x, val .y) ... # .x mutable and .y immutable

Functions defined to use values outside their boundaries are closures. After a closure is defined, it is not affected by changes to those outside values.

Closures cannot be combined with implied parameters. It could only be one or the other.

Parameters are implied by having no parentheses directly attached to the f token. For example, f (.x - '0') ^ (.x - '0') is a function that has no explicit parameters (1 implied).

The implied order of implied parameters is based on the string sort order of their names, not on their order of appearance in the function.

Implied parameters are convenient for small functions, such as in the following example.

val .factorial = f if(.x < 2: 1; .x x self(.x - 1))

Recursion can be used when the function definition is directly assigned to a variable, such as the following.

val .fibonacci = f(.x) if .x < 2 { .x } else { .fibonacci(.x - 1) + .fibonacci(.x - 2) }

This example function uses recursion and a single statement (if expression) without curly braces (braces shown are part of the if expression, not for the function).

Recursion can also be used by making a call with the self token.

val .fibonacci = f if .x < 2 { .x } else { self(.x - 1) + self(.x - 2) } # or shortened to... val .fibonacci = f if(.x < 2: .x ; self(.x - 1) + self(.x - 2))

Using the self token, recursion does not require assignment (may be used with anonymous functions). This also makes it possible to combine implied parameters and recursion, which you cannot do when using the name.

Note that the built-in map(), fold(), and foldfrom() functions, or for loops, can often be used instead of recursion.

An explicit return can be used, but a function's last value is its implicit return value.

All functions return something, even if it's nothing (null).

User-defined functions can be called with parentheses, such as .x().

Built-in functions can be called with either parentheses or an unbounded argument list, such as split re/[!_]/, "a!b_c" which would split the string "a!b_c" into an array of 3 strings.

If you do **not** use an unbounded list or parentheses on a function name, it is not a call, but a reference to the function.

An unbounded list (used to call a built-in function) cannot be used in the test expression of an if expression (must use parentheses for a function call in this case).

Unbounded lists end at a line return or end of file, or closing parenthesis, curly brace, or square bracket. So, they are not bounded by their own set of parentheses.

val .n = random 10 # random() list bounded by line return or end of file # same as val .n = random(10)

val .factorial = f(.n) fold(f{x}, series .n) # series() list bounded by closing parenthesis of fold()

The following example contains no unbounded lists. It merely allows continuation of a list after a line return preceded by a comma.

val .new = foldfrom( f(.hash, .key, .value) .hash ~ h{.key: .value}, h{}, w/a b c d/, [1, 2, 3, 4], ) # use toHash() instead, BTW

Unbounded lists end before a comma that precedes a line return.

# with .s already defined ... val .nums = map( f(.i, .d) if(.i rem 2 == 0: .d x 3; .d), series 13, map f .c-'0', s2cp .s, ) # unbounded list on series() ends before a comma preceding a line return # also note that both lists for s2cp() and the second call to map() end before a comma preceding a line return

An unbounded list takes all items it until it is closed. If an unbounded list is used within an another, it takes the remaining items.

writeln "filtered: ", where f .x rem 2 == 0, .arr # unbounded lists used with both where() and writeln(); where() takes last arguments (an anonymous function and a variable)

val .ns = toString random 10 # generate a random number from 1 to 10 and save as a string to .ns # same as val .ns = toString(random(10))

Sometimes using parentheses and explicit parameters will give more clarity. For example, I could write...

val .factorial = f fold f .a x .b, series .n

...but this might be more clearly written as...

val .factorial = f(.n) fold(f .a x .b, series .n)

- .n no longer an implied parameter of .factorial()
- fold() using parentheses
- still no parentheses on series(), but it's clear
- still have implied parameters .a and .b on the anonymous function, but it's not confusing

...or we use an operator implied function...

val .factorial = f(.n) fold f{x}, series .n