Hi Martin,
Do you intend your Lambda domain to represent unevaluated lambda
expressions? Or do you want immediate evaluation of a function application?
Looking at
lambda:(x:%,y:%) -> %
++ Constructs a node containing multiple terms
and its implementation
lambda(x:%,y:%): % == [[x,y]]
it looks more like you are implementing a lazy version that explicitly
needs an call to "evaluate" (probably "redux" in your case).
My suggestion is that you add some documentation lines that clearly
describe your design decision.
Ralf
PS: I somehow don't like the above lambda function, because it's a bit
confusing since you probably rather mean "function application" and not
lambda abstraction.
Aldor would allow to write a function
apply(x:%,y:%): % == [[x,y]]
where later you could simply type
x y
in order to call apply(x,y).
I think, in FriCAS, if you use "elt" in place of "apply", it should work
similarly. I have, however not tested it, so you must experiment yourself.
Ralf
--
You received this message because you are subscribed to the Google Groups "FriCAS -
computer algebra system" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/fricas-devel?hl=en.
