No language is perfect

In this thread we design a perfect language

I was thinking about making a language like this once.

It would be like LISP but instead of using () all the time (which is hard to read), you would use ({[({[]})]}) and keep repeating that.  So every time you nest them, you would go to the next type of parens:


(defun fibonacci {N}
  {if [or (zerop N) (= N 1)]
      1
    [let
    ({F1 [fibonacci (- N 1)]}
     {F2 [fibonacci (- N 2)]})
      (+ F1 F2)]})

It's a lot easier to read.