Here, I’ll show you:

(let* ((abc '(a b c))
       (abc2 abc)
       (fish '(f i s h))
       (fish2 fish))
  (push! 'nope abc)
  (mutate-cons! 'yeah fish)
  (list abc abc2 fish fish2))

Returns this:

((nope a b c) (a b c) (yeah f i s h) (yeah f i s h))

This is an interesting perspective on the “power” of different languages.

This is an interesting perspective on the “power” of different languages.

Ever since I started this blog, I’ve had in mind to devote a post to the relationship between the strong theory of vau-calculus and the no-go theorem of Mitchell Wand’s 1998 paper The Theory of Fexprs is Trivial.

Not super invested in use case, but this is a nice demonstration of circumventing a no-go theorem and operational semantics.

I love this incredible game.

Hy is a Lisp dialect that’s embedded in Python.

What makes Lisp powerful is the fact that Lisp runs in the same context it’s written in. It’s s-expressions all the way down.

What makes Lisp powerful is the fact that Lisp runs in the same context it’s written in. It’s s-expressions all the way down.

What makes Lisp powerful is the fact that Lisp runs in the same context it’s written in. It’s s-expressions all the way down.

I use the built in japanese to english translator in Firefox to read this interesting blog with moderate success.