Order is based primarily on lambda calculus, and is vaguely similar in semantics to languages such as ML or Scheme, offering first-class functions with partial application, lexical scope, first-class continuations, arbitrary-precision arithmetic, and built-in operators for compound types.