In message <[EMAIL PROTECTED]:, S.D.Mechveliani writes:
:
: I tried to find out how Haskell understands the "lambda" programming.
: Here is the script for the length of a list.
: This is the so-called continuation passing stile, I believe.
:
: lng :: [a] -> Int
:
: lng = (\ xs ->
: (
I tried to find out how Haskell understands the "lambda" programming.
Here is the script for the length of a list.
This is the so-called continuation passing stile, I believe.
lng :: [a] -> Int
lng = (\ xs ->
( (\xs c -> if null xs then 0 else 1+(c (tail xs) c) )
xs
