Builtins

The operations built in to the language are described here, roughly organized by topic and significance. Examples ought to be included.

Worth note, this describes not how one ought to use the language, but the operations built into the core of the interpreter. Though many of these operations will be useful in many many conceivable programs, their appearance here is only to document the very core of the language. Everything not detailed here is composed of things here.

atom

rest

evalarg

evalarg is a tricky but incredibly useful builtin, and in a sense functions much like a combinator. Given two arguments, it evaluates the second, and puts them back in order, so that the first argument will be called on the evaluated version of the second. Most useful for controlling the order of execution.

+â (x-times-n (rand 10) 5)
+ â (0 8 3 9 7)
+â (evalarg x-times-n (rand 10) 5)
+ â (2 2 2 2 2)

type

@@ -189,6 +200,8 @@ note: the prior line just shows how builtins might be represented in the languag mul div mod + gt + lt

+ (add)

@@ -229,6 +242,28 @@ note: the prior line just shows how builtins might be represented in the languag â (% 30 7) â 2

> (greater than)

Applies to two uints, returns t or nil depending on whether the first argument is greater than the second.

+â (> 10 3)
+ â t
+â (> 3 7)
+ â nil
+â (> 4 4)
+ â nil

< (less than)

Applies to two uints, returns t or nil depending on whether the first argument is less than the second.

+â (< 10 3)
+ â nil
+â (< 3 7)
+ â t
+â (< 4 4)
+ â nil

combinators

diff --git a/doc/index.html b/doc/index.html index a73840a..c026fa6 100644 --- a/doc/index.html +++ b/doc/index.html @@ -3,13 +3,13 @@ - klaupacius + klapaucius

klaupacius

klapaucius

A language so inspired by lisps, forths and array languages that it resembles none of these.

A combinator-based, concatenative, tacit lisp with automatic memory management, immutability, partial application, some church encodings, without variables or lambdas, where everything is a function.

repl src