Bel Lisp

http://paulgraham.com/bel.html

http://ai.neocities.org/AgiMind.html -- Artificial General Intelligence

>>1
Oh great, more bullshit fucking around with tiny gimmicky operations, instead of offering a useful language like Glorious Common Lisp.

scheduled reminder that LISP sucks

Paul Graham is all talk but no action!

https://sep.yimg.com/ty/cdn/paulgraham/belexamples.txt?t=1570993483&

Symta:
[a b @[c d e]]

Bel:
(cons 'a 'b '(c d e))

Symta:
[@[c d e] a b]

Bel:
Oooops!!!11

Symta:
[a @[c d e] b]

Bel:
Fuck you!!!11

Also
(pop (find pair w))

Is a really bad Ruby-tier idea.
1. Lisp isn't C/C++ to support references to references.
2. It breaks abstraction.

The proper way to do it is by introducing explicit locate function, which is similar to find, but returns a path inside said structure to the element. For array it would be just an index of said element, for tree a path inside said tree.

`(a ,'(c d e) b)

(def part (f . args)
(fn rest
(apply f (append args rest))))

(def insert (f x ys)
(if (no ys) (list x)
(f x (car ys)) (cons x ys)
(cons (car ys) (insert f x (cdr ys)))))

(def sort (f xs)
(foldr (part insert f) nil (rev xs)))

cons and cdr feel a bit like assembler mnemonics

Now this is a story all about how
My life got flipped turned upside down
And I'd like to take a minute, while my memory's crisp
I'll tell you how I became the prince of a code called Bel Lisp