are produced.
On Thu, Jul 25, 2013 at 11:02 AM, Justin Paston-Cooper
paston.coo...@gmail.com wrote:
I hadn't yet tried profiling the programme. I actually deleted it a few
days
ago. I'm going to try to get something new running, and I will report
back.
On a slightly less related track: Is there any
is
running instead of everything at the end as would be with the State monad?
On 23 July 2013 22:13, Johan Tibell johan.tib...@gmail.com wrote:
On Tue, Jul 23, 2013 at 5:45 PM, Ben Gamari bgamari.f...@gmail.com
wrote:
Justin Paston-Cooper paston.coo...@gmail.com writes:
Dear All
allow changes in
state to a number of variables, such as an aggregation over a certain field
in the input. I do not currently have knowledge of the FFI, and how it
might be used in this case. I would appreciate any suggestions as to where
I should look further.
Regards,
Justin Paston-Cooper
Thanks for all the informative replies. SBV seems the simplest solution
right now, and speed isn't too much of an issue here. Anything under 20
seconds per solution should be bearable.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hello,
Can anyone suggest a library written in Haskell which can solve equations
of the form xM(transpose(x)) = y, where x should be an integer vector, M is
an integer matrix and y is an integer? I'm aware that Mathematica can do
this, but I would like something written in Haskell. I haven't been
