26 Jul 2000 19:30:42 GMT, Marcin 'Qrczak' Kowalczyk <[EMAIL PROTECTED]> pisze:
> > instance (ForeignArg fa ha, Call ff hf) => Call (fa -> ff) (ha -> hf) where
> > callIO f = callIO . convertArg (\fa -> f >>= return . ($fa))
>
> BTW. I have not tested if it works nor thought how it would exec
I have studied the materials but not tried it out. the effort is directed
towards allowing to build algebraic structures with haskell in a way closer
to regular algebra (i was reading this summer the classic macLean &
Birkhoff, algebra, (3rd edition) - highly recommended!). the proposal is
very in
| The tricky
| bit will be, as you say, defining a data structure that is "just"
| general enough.
Just start with the simplest thing which allows you to do what
you want to do, and extend it as needed. The other approach
-- trying to envision everything you might need and building it
in at the
Bjorn Lisper <[EMAIL PROTECTED]> writes:
}}>cos+sin-- intent: \x->((cos x)+(sin x))
}}>cos(sin) -- intent: \x->cos(sin(x))
}} have equivalents in Fortran 90 and HPF, although with arrays rather than
}} functions. For instance, one can write "A+B" to mean an array with value
