In the beginning, there was the Cons, and the Cons was nil . But nil is heavy. nil takes up space. Enter .
But after a weekend of tinkering, I’m genuinely excited. Tlen Lisp isn’t trying to be the fastest or the most purely functional. Instead, it’s focused on something most Lisps overlook: .
(example-length-usage)
If you're looking for how to get the length of a list in Lisp, here's a simple example using Common Lisp:
(defn add [x y] (+ x y))
Inspired by Clojure’s -> and Elixir’s |> , Tlen makes the pipeline operator a , not just a macro.
; Define the function 'fade' ; n: the starting integer let fade n print n tlen lisp
; Recurse with n-1, and explicitly 'tlen' (erase) the current n ; This is destructive recursion fade tlen n .
To code in Tlen is to whisper into a hurricane and expect a reply. In the beginning, there was the Cons, and the Cons was nil
(-> data (filter even?) (map square) (reduce + 0))
defn factorial n if <= n 1 1 * n factorial - n 1 . Instead, it’s focused on something most Lisps overlook: