Documentation

use (name; value) to define something. the definition can be recursive. value is executed and name is set to the final state of the stack, i.e. (name; 1 3) is possible

use ' to push instead of apply to the stack, e.g. '(a -> a). This is useful for lazyness, i.e. '(->lazy evaluated thing)

• +, -, *, /, ^, sqrt: mathematical operations
• ==: equality (automatically derived for all types); returns a b -> a if true, a b -> b if false
• typeof: returns the type of the object
• pair, fst, snd: pairs two objects, gets first or second item of pair
• tuple: used like ... 3 tuple; creates an n tuple of n items on the stack
• !!: index into a tuple
• len: length of a tuple
• unsafeCoerce: unsafely transforms one type into another. useage: 1 "type unsafeCoerce
• true, false: true/false used in ==
• stop: equivalent to "stop
• inv: equivalent to 1 x /
• fold: equivalent to x acc fn -> acc '(-> x acc fn 'fn fold) 'x \"stop ==