Re^2: Indispensible language features

Replies are listed 'Best First'.
Re^3: Indispensible language features by FoxtrotUniform (Prior) on Jul 02, 2004 at 16:40 UTC
I think "Anonymous functions" are implied by the OP in "Lambdas (basically, anonymous closures)". "Implied"? Yeah, I probably should have been more clear. When I mentioned "lambdas", I meant "anonymous functions, closures, and combinations thereof". Incidentally, one thing that I'm really starting to like about Haskell is its ability to seamlessly manipulate functions via currying, composition, and higher-order functions like `flip`. I'll try to come up with some examples that are neither trivial nor obscure for the next part of my Haskell intro. `-- F o x t r o t U n i f o r m Found a typo in this node? /msg me % man 3 strfry`	[reply] [d/l]
Re^4: Indispensible language features by stvn (Monsignor) on Jul 02, 2004 at 17:56 UTC
Incidentally, one thing that I'm really starting to like about Haskell is its ability to seamlessly manipulate functions via currying, composition, and higher-order functions like flip. You may want to also take a look at Standard ML as well, it has many similarities to Haskell, but is less strict about being functional (meaning, you can do do imperitive programming with it if you really want too). -stvn	[reply]
Re^5: Indispensible language features by FoxtrotUniform (Prior) on Jul 02, 2004 at 17:58 UTC
You may want to also take a look at Standard ML as well, it has many similarities to Haskell, but is less strict about being functional (meaning, you can do do imperitive programming with it if you really want too). I prefer Scheme and Perl for that sort of thing, but thanks. `-- F o x t r o t U n i f o r m Found a typo in this node? /msg me % man 3 strfry`	[reply]