Hi haskell-cafe,
From a non programmer : Does someone know the exact source, book, page no etc. where Haskell Curry intoduced and developed its concept of a curry function.
Is there an exemple of such a function in the Haskell language ? Thanks, Normand mailto:leclercn@globetrotter.net
On Tue, 7 Aug 2001, Normand Leclerc wrote:
Hi haskell-cafe,
From a non programmer : Does someone know the exact source, book, page no etc. where Haskell Curry intoduced and developed its concept of a curry function.
I'm afraid I don't know anything not mentioned by http://www.cs.nott.ac.uk/~gmh/faq.html#currying I wonder if "Combinatory logic", Haskell B. Curry and Robert Feys, North-Holland, 1958, might cite the right earlier sources.
Is there an exemple of such a function in the Haskell language ?
Most certainly. For instance, we can define: f :: Integer -> Integer -> Integer f x y = x + y g = f 1 Then,
:type f Integer -> Integer -> Integer :type g Integer -> Integer f 2 3 5 g 4 5
I hope that helps. -- Mark
Hi haskell-cafe,
From a non programmer : Does someone know the exact source, book, page no etc. where Haskell Curry intoduced and developed its concept of a curry function.
Currying is to represent a function of multiple arguments as a function of a single argument that returns a function. So if f (x, y) = F, curry f x is a function that, when applied to y returns F. I think that Currying was actually invented by Schönfinkel, but it's just mentioned in passing in "Über die bausteiner mathematischen logik" (apologies if spelling is wrong) or in "Grundlager ..." whatever the other one is called, I can't remember.
Is there an exemple of such a function in the Haskell language ?
curry! -- Jón Fairbairn Jon.Fairbairn@cl.cam.ac.uk 31 Chalmers Road jf@cl.cam.ac.uk Cambridge CB1 3SZ +44 1223 570179 (after 14:00 only, please!)
participants (3)
-
Jon Fairbairn -
Mark Carroll -
Normand Leclerc