on Nvidia ATI cards the same)
hex
On Thu, Oct 27, 2011 at 3:45 PM, Rafael Gustavo da Cunha Pereira Pinto
rafaelgcpp.li...@gmail.com wrote:
Hi folks,
I just bought a NVidia Fermi-based card and remembered reading a few
months (years?) ago about some effort to accelerate array processing
on the advantages of such GPU data processing on the signal
processing field.
Best regards,
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of
aligning to 8-byte boundaries)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe
This really sucks. Not even LLVM is ported to 64-bit Windows.
This is mainly because Windows uses 32-bit pointers for compatibility.
http://archive.gamedev.net/reference/programming/features/20issues64bit/
Atc
Rafael
On Thu, Jun 9, 2011 at 08:04, Rafael Gustavo da Cunha Pereira Pinto
Just found it! It is pretty much what I was looking for,
On Thu, Sep 9, 2010 at 10:08, Wolfgang Jeltsch
g9ks1...@acme.softbase.orgwrote:
Am Mittwoch, den 08.09.2010, 11:47 -0300 schrieb Rafael Gustavo da Cunha
Pereira Pinto:
The input and output are infinite streams. I have a few questions
on integrator loops like this one:
x(t) (+) Integrator --|--- y(t)
^|
||
Note that x(t) would be a function, and I would expect to create a function
y, based on this flow!
Rafael Gustavo da Cunha Pereira Pinto
--
Rafael Gustavo da
of the example for it to actually do
something?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
Just to clarify the issue, I will propose the puzzle:
There is a single 10 digit number that:
1) uses all ten digits [0..9], with no repetitions
2) the number formed by the first digit (right to left, most significant) is
divisible by one
3) the number formed by the first 2 digits (again right
Hi folks,
While solving a puzzle, I was posed the problem of finding if there was no
duplicates on a list.
First I used:
noneRepeated=null.(filter (1)).(map length).group.sort
But this seemed very unneficient, so I thought that I could detect the
duplicates while sorting, and devised this:
Hi folks,
How are the efforts on Haskell Platform for GHC 6.12.1 going?
I'm considering joining those brave heroes. Where can I apply?
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
THANKS!!
Just in time for Christmas!!
On Sat, Dec 12, 2009 at 12:22, Max Bolingbroke
batterseapo...@hotmail.comwrote:
2009/12/12 Rafael Gustavo da Cunha Pereira Pinto
rafaelgcpp.li...@gmail.com:
I know I should probably be asking to the GHC list, but is there any
update
on 6.12 since
!
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
This gives me the freedom to use Haskell wherever I am! The only downside is
that I have to edit packages.conf by hand everytime I install a package.
I would like to improve this, by making it more automatic. Do you haskellers
think it is possible?
Regards,
Rafael Gustavo da Cunha Pereira
why we use it?
--
竹密岂妨流水过
山高哪阻野云飞
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Mon, Aug 17, 2009 at 03:17, Sven Panne sven.pa...@aedion.de wrote:
Am Sonntag, 16. August 2009 22:10:23 schrieb Rafael Gustavo da Cunha
Pereira
Pinto:
BTW, as an enhancement for 2.2.2.0, you could treat unnamed mouse
buttons.
Mouses with more axis and more buttons are becoming
.
___
Haskell mailing list
hask...@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
--
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
failed to install.
OpenGLRaw-1.0.1.0 failed during the configure step. The exception was:
and I don't see how to get the openglraw to build or what has changed
thanks for any help
-Carter
On Thu, Jul 30, 2009 at 8:23 PM, Rafael Gustavo da Cunha Pereira Pinto
rafaelgcpp.li...@gmail.com
BTW, OpenGL-2.3 breaks GLFW-0.3
On Wed, Jul 29, 2009 at 22:47, Felipe Lessa felipe.le...@gmail.com wrote:
On Wed, Jul 29, 2009 at 10:24:23PM -0300, Rafael Gustavo da Cunha Pereira
Pinto wrote:
mapAccumL was added to Data.Traversable in package base-4. GHC 6.8.2 uses
base-3
Just a heads up:
I did a cabal install Tensor on my Ubuntu box, and got the following
message:
src/Data/Tensor.hs:333:18: Not in scope: `mapAccumL'
I will investigate a little more and let you know.
On Wed, Jul 29, 2009 at 13:55, Felipe Lessa felipe.le...@gmail.com wrote:
On Wed, Jul 29,
That was quick!
mapAccumL was added to Data.Traversable in package base-4. GHC 6.8.2 uses
base-3...
I think I will be forced to upgrade my GHC by hand... I just can't stand
6.8.2 anymore...
On Wed, Jul 29, 2009 at 22:17, Rafael Gustavo da Cunha Pereira Pinto
rafaelgcpp.li...@gmail.com wrote
da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
distributions except, maybe, gentoo.
The automation process would have to run through hackageDB tracking
dependencies and compiling each needed library. Pretty hard stuff...
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell
Is there anyone working on a Haskell Platform package for Ubuntu?
GHC in Ubuntu is a pain!
Regards
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
is working on packaging, but until then (or if someone
on Ubuntu steps up), you'll need to use the Unix tarball:
http://hackage.haskell.org/platform/2009.2.0.1/haskell-platform-2009.2.0.1.tar.gz
-- Don
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc
, considering I would have learned enough of
Haskell state monads on step 2 to have just to worry about the physics of
the problem!!!
I'll keep you updated as my tests go, and hopefully I will have a working
demo of the task written in Haskell by Xmas... 2010! ;-)
Best regards,
Rafael Gustavo da
Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
with such optimism ...
Stil, I'm glad to have done it. Lots of fun! My thanks to the
organizers!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
2009/6/29 Lanny Ripple la...@cisco.com
When you get bored or stumped with the problem you might pass your
time with Orbiter [http://orbit.medphys.ucl.ac.uk/]. Or you could
just use all the orbital mechanics math from the documentation. :)
Enjoy,
-ljr
That's cool... I'll try it
to be done.
--Max
2009/6/23 Rafael Gustavo da Cunha Pereira Pinto
rafaelgcpp.li...@gmail.com:
Hi,
The good folks here are really quiet about the ICFP Contest. Is anyone
participating this year?
As in the previous four years, I will probably download the problem, take
a
look
!
Best regards,
Rafael Gustavo da Cunha Pereira Pinto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing
2009/2/5 Henning Thielemann lemm...@henning-thielemann.de
-- Forwarded message --
From: Henning Thielemann thunderb...@henning-thielemann.de
To: Rafael Gustavo da Cunha Pereira Pinto rafaelgcpp.li...@gmail.com
Date: Thu, 05 Feb 2009 14:43:13 +0100
Subject: Re: [Haskell-cafe
On Wed, Feb 4, 2009 at 05:15, Neal Alexander wqeqwe...@hotmail.com wrote:
Array is no good man! Quad Tree matrices perform much nicer from what I've
seen.
I wrote some matrix stuff based on D. Stott Parker's Randomized Gaussian
elimination papers
to use
Arrays and Parsec)...
Bob
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Rafael Gustavo da Cunha Pereira Pinto rafaelgcpp.li...@gmail.com
:
Hello folks
After a discussion on whether is possible to compile hmatrix in
Windows, I decided to go crazy and do a LU decomposition entirely in
Haskell...
At first I thought it would
On Wed, Feb 4, 2009 at 17:09, Dan Piponi dpip...@gmail.com wrote:
2009/2/3 Rafael Gustavo da Cunha Pereira Pinto rafaelgcpp.li...@gmail.com
:
After a discussion on whether is possible to compile hmatrix in
Windows, I decided to go crazy and do a LU decomposition entirely
On Wed, Feb 4, 2009 at 19:14, Dan Piponi dpip...@gmail.com wrote:
On Wed, Feb 4, 2009 at 12:57 PM, Rafael Gustavo da Cunha Pereira Pinto
rafaelgcpp.li...@gmail.com wrote:
Those different representations are derived from my (very) low Haskell
handicap! :-D
BTW That wasn't intended in any
=a!(i,j)-(lik i)*a!(k,j)
Still needed:
1) Partial pivoting
2) Profiling... Lots!
3) Parallelize
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
is exactly what you will be wanting so this won't
work for you.
I ran into exactly this problem myself. I actually didn't get as far as a
run-time error as I got a linker error.
I don't have any solution for you though, sorry.
regards
allan
Rafael Gustavo da Cunha Pereira Pinto wrote:
Hi
Well, I guess I am not the only one!
This blog show exactly what I am looking for!
http://quantile95.com/2008/10/31/ann-blas-bindings-for-haskell-version-06/
On Wed, Jan 28, 2009 at 08:21, Rafael Gustavo da Cunha Pereira Pinto
rafaelgcpp.li...@gmail.com wrote:
I was planning to recompile
hmatrix on Windows? How did you do it?
Thanks,
Rafael
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi,
I see Hugs last source code snapshot dates back to 2006. Was there any
updates?
Regards
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
choosing simpler examples, like Wadler's expression evaluator.
On Tue, Jan 13, 2009 at 21:07, Benedikt Huber benj...@gmx.net wrote:
Rafael Gustavo da Cunha Pereira Pinto schrieb:
Yes, I've read it twice, and it is a nice explanation that yes, the
reader monad is an application
extended version on my vacations... maybe
a WikiMonad... or MonadPedia... :-)
After all, it is my duty as a haskell noob to write another monad tutorial!
:D
Cheers!
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing
, Jonathan Cast jonathancc...@fastmail.fmwrote:
On Tue, 2009-01-13 at 12:56 -0200, Rafael Gustavo da Cunha Pereira Pinto
wrote:
Last night I was thinking on what makes monads so hard to take, and
came to a conclusion: the lack of a guided tour on the implemented
monads.
...
Inspired
be readable and understandable (which also
partially causes (1) as people just don't think to look for papers at
all.)
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
of data per second that
they end up keeping, out of the petabytes that are produced in the
first place (or something).
There is a lot of data filtering, looking for the right trigger event...
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc
be wired together.
Do you think a compiler for this block language could this be
implemented in Haskell? What about using the Arrow monads?
Best Regards
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing
of
Haskell and OCaml at the top end.
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc
are pretty fast.
I used a handgrown rope-like structure for ICFPC07 but I wish I had
known about Sequence; it would have likely just been better.
-- ryan
2008/9/19 Rafael Gustavo da Cunha Pereira Pinto
[EMAIL PROTECTED]:
Hi all,
Is there any implementation of the rope
-- Forwarded message --
From: Rafael Gustavo da Cunha Pereira Pinto [EMAIL PROTECTED]
Date: Mon, Sep 22, 2008 at 15:46
Subject: Re: [Haskell-cafe] hGetContents and lazyness
To: Max Vasin [EMAIL PROTECTED]
Why don't you use OpenFile?
getPackageList packageFile = do
write a bytestring-rope
that outperforms lazy bytestrings please :)
I'll give it a try, but cannot promise anything on the outperform part!
:-)
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing list
Haskell
2008/9/19 Rafael Gustavo da Cunha Pereira Pinto
[EMAIL PROTECTED]:
Hi all,
Is there any implementation of the rope data structure in Haskell?
I couldn't find any on Hackage, and I am intending to implement it.
Regards,
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer
and it seemed ok.
If only Gödel was wrong... :-)
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
Hi all,
Is there any implementation of the rope data structure in Haskell?
I couldn't find any on Hackage, and I am intending to implement it.
Regards,
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing list
Is there anyone packing GHC 6.8.3 for Ubuntu Hardy?
Thanks
--
Rafael Gustavo da Cunha Pereira Pinto
Electronic Engineer, MSc.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
64 matches
Mail list logo