This is meant to be similar in spirit to the super-minimal lisp in 📜 Recursive Functions of Symbolic Expressions and Their Computation by Machine.
let
instead of
label
)
(When compared to the original Lisp paper)
eval
builtin function
Midnight also guarantees tail recursion elimination, though this isn't really a "change".
lambda
,
let
(recursive)
quote
,
eval
if
car
,
cdr
,
cons
,
pair?
,
list-empty?
symbol?
symbol-eq?
,
codepoints->symbol
,
symbol->codepoints
int?
,
+
,
-
,
*
,
/
,
%
,
<
,
=
,
>
crash
,
trace
,
trace-time