I'm neither a Julia nor even a competent programmer, but since no one else has responded I'll take a shot at it.
I think that might be fair description of Mathematica, but not of Julia. Julia is very much a multi-paradigm language, it's not pure enough in any sense to be considered a member of any family. On Wednesday, June 26, 2013 4:38:33 PM UTC-4, Ben Racine wrote: > > I stumbled across this on wiki... > > The use of S-expressions <http://en.wikipedia.org/wiki/S-expression> which > characterize the syntax of Lisp was initially intended to be an interim > measure pending the development of a language employing what McCarthy > called "M-expressions <http://en.wikipedia.org/wiki/M-expression>". As an > example, the M-expression car[cons[A,B]] is equivalent to the > S-expression (car (cons A B)). S-expressions proved popular, however, and > the many attempts to implement M-expressions failed to catch on. > > I've seen the (awesome) language designers mention that Julia can be > thought of a Lisp (in different words)... and I'm just wondering if anybody > cares to confirm, expound, or deny this. > > Main source: > http://en.wikipedia.org/wiki/History_of_the_Scheme_programming_language > Further background: http://en.wikipedia.org/wiki/M-expression >
