Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number

Re^2: RFC: A Perlesque Introduction to Haskell, Part One (DRAFT)

by FoxtrotUniform (Prior)
on Jun 24, 2004 at 01:25 UTC ( #369216=note: print w/replies, xml ) Need Help??

in reply to Re: RFC: A Perlesque Introduction to Haskell, Part One (DRAFT)
in thread RFC: A Perlesque Introduction to Haskell, Part One (DRAFT)

foldl is a lot like reduce in the List::Util module, which I believe will be a builtin in Perl 6.

foldl is also a lot like foldl in the Language::Functional module. :-)

Also, I know you're trying to keep it reasonably short, but I think it would be really cool to show an example of constructing recursive polymorphic types, and the fact that you can have different data constructors with completely different type arguments. In other words, the fact that in Haskell you can implement large parts of your program logic just by the way you design your types.

I'm getting there... I'm planning to talk about Haskell's typing system in more detail in a later installment.

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

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://369216]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (4)
As of 2020-02-22 22:00 GMT
Find Nodes?
    Voting Booth?
    What numbers are you going to focus on primarily in 2020?

    Results (102 votes). Check out past polls.