indexes into data structures are indistinguishable from function calls Ooh! That sounds interesting! Possibly really confusing though?
From the website: Arc is designed above all for exploratory programming: the kind where you decide what to write by writing it My favorite kind :-) Perhaps I should venture in there too...
Yeah :-) From a brief flick through, it seems to combine most of the good features of Common Lisp with the good features of Scheme. It's very much a work-in-progress, though - no Unicode support, for instance.
I'd be interested in your opinion of PLT-Scheme in this context. Are there any obvious reasons why one is better than the other? For scripting? For exploratory programming?
There's been a lot of criticism of Arc, much of it saying "he hasn't done anything really new, all this stuff has been done in Lisp dialects before!" But I think it was probably a good idea to explicitly not be a Scheme, so Arc can grow in non-Schemey directions.
I dunno what PLT Scheme's like, but I hear good things about it :-) Arc looks cool, but it's very much a version 0 at the moment.
The challenge for me here (as someone whose only lisp experience is a smattering of the widely decried emacs-lisp), is figuring out which bits of arc are just lisp, and which bits are genuinely new.
So far as I can tell, at the moment, arc is just PLT scheme without so many libraries, with shorter names for several things, some syntactic sugar (the function composition operator for example) and some new looping constructs.
There's almost certainly more to it than that, but I'm having trouble finding it without learning PLT first. Given those first impressions, I'm thinking that maybe my time would actually be better spent learning PLT first...
Oh yes - and with strings as lists - I certainly approve of that.
I dunno - does anyone with more knowledge have an opinion on which is worth spending time on first?
I'd guess that K2 is version 2 of K, which is a semi-proprietary APL-descendent: here's a nice Kuro5hin article on it. I'm reminded of someone complaining about "Haskell's Eigerlike learning curve": hopefully K2 isn't a reference to the steepness of K's learning curve...
That's actually quite a fun challenge - I was doodling Perl versions of the code on envelopes over dinner, and I'm going to try to write a version in Arc and blog about it. But what bugs me is this: why didn't he just use grep?
*furkles through man grep. Gives up on grep's broken regex syntax*
OK, why didn't he use perl -ne 's/--.*//; print "$_\n" foreach /\b\w*widget\b/gi' | sort | uniq?
Comments 15
Ooh! That sounds interesting! Possibly really confusing though?
From the website: Arc is designed above all for exploratory programming: the kind where you decide what to write by writing it
My favorite kind :-) Perhaps I should venture in there too...
Reply
Reply
Reply
Reply
There's been a lot of criticism of Arc, much of it saying "he hasn't done anything really new, all this stuff has been done in Lisp dialects before!" But I think it was probably a good idea to explicitly not be a Scheme, so Arc can grow in non-Schemey directions.
I dunno what PLT Scheme's like, but I hear good things about it :-) Arc looks cool, but it's very much a version 0 at the moment.
Reply
So far as I can tell, at the moment, arc is just PLT scheme without so many libraries, with shorter names for several things, some syntactic sugar (the function composition operator for example) and some new looping constructs.
There's almost certainly more to it than that, but I'm having trouble finding it without learning PLT first. Given those first impressions, I'm thinking that maybe my time would actually be better spent learning PLT first...
Oh yes - and with strings as lists - I certainly approve of that.
I dunno - does anyone with more knowledge have an opinion on which is worth spending time on first?
Reply
Reply
Reply
it was brought to my attention by this post on planet.haskell.
A quick google for "K2 Language" failed to find any clues about the other terse language mentioned.
Reply
I'd guess that K2 is version 2 of K, which is a semi-proprietary APL-descendent: here's a nice Kuro5hin article on it. I'm reminded of someone complaining about "Haskell's Eigerlike learning curve": hopefully K2 isn't a reference to the steepness of K's learning curve...
Reply
*furkles through man grep. Gives up on grep's broken regex syntax*
OK, why didn't he use perl -ne 's/--.*//; print "$_\n" foreach /\b\w*widget\b/gi' | sort | uniq?
Reply
perl -e 'while (<>) { s/--.*//; $widgets{$_}++ foreach /\b\w*widget\b/gi } print join "\n", keys %widgets'
Reply
Leave a comment