David Z Maze declaimed:
> One of these days
> I'll get around to doing a reasonable-sized project in Haskell,
> though: it has an incredible type system and seems to do the right
> thing around "classes", though this is only so meaningful in a purely
> functional language. Saying "well, I wrote about half of a compiler
> in Haskell" certainly gets interesting reactions from the right sort
> of people... :-)
Heh, me too! (Although likely on a more modest scale) I've just finished
a Programming Languages course where we used Haskell to write a lambda
calculus evaluator. Writing the input expressions as structures (Lambda
"x" (Var "y")) was so irritating that I wrote a parser to field string
input ("/x.y"). It works nicely, although only the interpreter's
built-in limits keep it from blowing up on expressions that expand
infinitely.
For those who've never seen this language, here's the quicksort
algorithm in 2 lines:
qsort([]) = []
qsort((a:b)) = qsort([x | x<-b, x<a])++[a]++qsort([y| y<-b, y>a])
Not sure about licensing, but it's small, free, and available for *nix,
MacOS, and Wintel. http://haskell.org
--
Paul Mackinney
[EMAIL PROTECTED]
--
To UNSUBSCRIBE, email to [EMAIL PROTECTED]
with a subject of "unsubscribe". Trouble? Contact [EMAIL PROTECTED]
