Code golf: create a lisp repl

badatprogrammingibe

This might be a fun challenge, and I truly believe that scratch needs more lisp interpreters.
We can score by amount of scratch blocks required.
So what will an interpretation need to qualify as a lisp challenge?
An interpretation must support:

Primitives:
cons
car
cdr
atom? OR pair?
eq?

Forms:
if OR cond (your choice)
lambda
quote
label OR define OR defun OR equivalent form.

Support for arithmetic, quote shorthand ('), tail call optimization, comments, and garbage collection is not required, though perhaps you might still include them in a fork of your project. Booleans can be implemented however you like.

Last edited by badatprogrammingibe (Oct. 23, 2018 06:06:20)

Discuss Scratch