gregcman / ridikulisp Goto Github PK

;;This is the entire interpreter!
(defun step (k) (loop (setf (caadar k) (cdaaar k) k (cadr k))))

///psuedo-C. Assume that pointers to ints can have their lowest bit flipped with & 1
int *k;
for (;;){
  **(1 & *k) = (1 & ***k);
  k = *(1 & k);
}

The program is completely made out of cons cells.

Turing-Completeness

Benefits:

Since the data structure is so simple, adding new features should be trivial. Like networking, live reloading, security, capabilities, and multithreading.

Drawbacks:

The simplicity of the interpreter means that the code is large and essentially unreadable after it is compiled.

Implemented:

• Garbage collection

Not Implemented:

• Basically everything else.

;;All these forms can be implemented by connecting cons cells together.
eq
if
atom
car
cdr

I was inspired by the "One Instruction Set Computers" found here: https://esolangs.org/wiki/OISC