Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister

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

by FoxtrotUniform (Prior)
on Jun 23, 2004 at 22:26 UTC ( #369194=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)

What you call extensionality is what I've known as currying.

Then I should do a better job.

Extensionality says that the following two definitions are equivalent:

foo = foldl1 f bar xs = foldl1 f xs -- note: xs is free on both sides
The reason this works is that xs is free on both sides of bar: it's basically a placeholder that says "a list should go here". Both of these functions have type (a -> a) -> [a] -> a (modulo monomorphism-restriction annoyances).

On the other hand, the function application

foldl f -- note: not a definition (type is [a] -> a)
is a curried expression: while foldl f xs returns a scalar, foldl f returns a function from lists to scalars. To me, currying means partial function application, and it's useful for producing ad-hoc functions where lambda is overkill.

I like your point that currying is easier to understand when you know about type signatures, and thanks for the link to MJD's talk.

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://369194]
and the web crawler heard nothing...

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

    Results (102 votes). Check out past polls.