Some rather full featured LISP interpreter has already been implemented in 163654 bits (under 20KB) of binary lambda calculus [1] (previous HN discussion at [2]). Wouldn't it be far simpler to implement binary lambda calculus in Malbolge and obtain a LISP interpreter running on Malbolge that way?
[1] https://woodrush.github.io/blog/lambdalisp.html
[2] https://news.ycombinator.com/item?id=32879848