Thanks Ladislav, for your corrections.
I have sent this also to the maintainer, Pixel.
I am not completely sure what function composition means.
Pixel said: "function composition is a function taking 2
functions and returning a new one."
Looking at some Haskell posts I see it kind of
glues two functions together, passing the result
from the first function into the second one.
There are (resolvable) problems when the number of
arguments are not the same, but, anyway...
Doesn't this just mean that this is function
composition:
add: func [a b][a + b]
mul3: func [a][a * 3]
add-mul3: func [a b][mul3 add a b]
?
Or it doesn't count because the "composition"
is specified in the body block, whereas Haskell
does it by referring only to the function names.
Also, let me just clarify that string joining can be
done with JOIN or REJOIN.
Anton.
> Hi Anton,
>
> >Those who were interested in this may have noticed
> >the site is down. The reason is the webhost was hacked
> >last week, so Pixel sent me his mirror site:
> >http://people.mandrakesoft.com/~prigaux/language-study
> >
> >You can see the rebol additions there.
> >
> >Anton.
> >
> >
> thank you. My observations:
>
> - you are saying, that the normal equality operator is deep as well as
> shallow ...
> - runtime evaluation: I suggest to add "...and dialect evaluating
> functions..."
> - actually, every function is created as anonymous in Rebol. After the
> creation you can give it a name.
> - function composition isn't COMPOSE
> - you wrote "if/then", but you probably meant "if/else"
> - exception catching is more likely TRY, than CATCH (?)
> - all but the first element can be NEXT probably
> - we can use JOIN/REJOIN to join a list of strings
> - exponentiation: ** works too
> - number negation: (- a) works too
>
> -L
--
To unsubscribe from this list, just send an email to
[EMAIL PROTECTED] with unsubscribe as the subject.
