Interesting - can anyone provide an in-depth comparison to LFE [1]? From a quick look, it looks like Joxa is more similar to Clojure than it is to Common Lisp, whereas LFE takes the opposite appoach.
Its mostly about approach. LFE (literally Lisp Flavored Erlang) is Erlang with an S-expression based syntax. Joxa is a self contained Lisp that happens to run on the Erlang VM.
Those are the core differences. Joxa also has some very clear and distinct goals of its own. Those goals are not really relevant to this discussion though.
Not quite, LFE is a self-contained Lisp system with all the things you would expect a lisp system to have. It has been designed to run on the Erlang/OTP system and to efficiently use all the features of that system and its VM. This means that LFE has a clean interface to Erlang/OTP so it can easily be used together with applications written in Erlang. Mixing components written in Erlang and in LFE to write a larger application is straight-forward and painless.
If I could rename it then a better name would be EFL (Erlang Flavoured Lisp), which is what it is. The "Flavoured" in the name comes from that I had earlier implemented a Lisp machines flavors system on another lisp, with an english spelling thrown in as a joke.
The obvious difference is that LFE is maintained by Robert Virding (one of the original creators of Erlang itself). I'd imagine this would translate to LFE being more "Erlangy", but this assumption comes from a lack of experience with either.
So a couple of comments here :-) Robert is actually an old-school Lisper (and a hard-core one, too). LFE has been inspired not only by CL but also Maclisp. The point being that, yeah, he's an Erlang guy, but he was first a Lisp guy (and has always remained so).
Second comment: LFE is a Lisp, but it's a Lisp whose first and foremost goal was to allow one to build fully Erlang (and OTP)-compatible systems in Lisp. Clojure's Lisp has a Java flavour; LFE's Lisp has an Erlang flavour. They are both very real and compelling Lisps :-)
I really like the idea of both Joxa and LFE (a Lisp on the Erlang VM!), but the main factor keeping me from using them for general purpose programming is the lack of "modern" collections. I would love to see them implement persistent data structures à la Clojure, with a unified interface for vectors, sets, etc. I know the Joxa stance is "make a good macro system and let users implement these" but as a (new) user, the task looks too intimidating.
The Elixir approach looks great, but it's unfortunately not a Lisp.
Indeed, it would be nice to have an EFL: Elixir Flavoured Lisp. (Lazy) Streams and clojure'ish protocols (lispy virtual methods) makes a big difference in abstraction. Erlang as it is, supports ADTs but not object abstraction (i.e. different kinds of set implementations with different implementation/representation) See http://www.cs.utexas.edu/~wcook/Drafts/2009/essay.pdf for discussion.
Thats exactly what it means. Its has a very simple syntax that is a nice mix of the semantics of Core Erlang laid on very straightforward and minimal lisp. The goal was to build up more semantically complex structures in the language itself. In effect, Joxa is designed as a platform for language design more then a language in and of itself. Now I just need to find the time to get back to it.
Yes, 'as'[0] in Python is a great example. Idk how establishing an alias could mean deleting anything other than the alias but interacting with the global/nonlocal keyword it can lead to some weird interactions[1].
Also in Python, True and False are a blessed instances of 1 and 0 with their logical operators overidden. So True + True == 2, but True is 1 => False.
You can also search #watjs for more example of 'unclean' semantics.
While I agree on the pragmatic value of it, and I think this is a pretty minor blemish in the semantics of Python.
You can easily have booleans as a completely different type, and yet avoid stuff like: `1 if boolean else 0`...
In Haskell, for example, `True + True` and `True == 1` are compile errors (unless you defined wacky Num instances), and the boolean/int "identity" is simply handled by `fromEnum` (which works on any Enum, not only Bool)
[1] https://github.com/rvirding/lfe