2007/8/30, Tony Sloane [EMAIL PROTECTED]:
On 26/08/2007, at 10:07 AM, Jeremy Shaw wrote:
There is also an old project to port nhc98 to PalmOS -- not sure if it
is still active, or how far they got. AFAIK, nothing was ever
released.
Yes, we were working on this at Macquarie Uni. The
On 8/30/07, Miguel [EMAIL PROTECTED] wrote:
What about running Haskell on a PostScript printer? PostScript IS
Turing-complete.
Yes, because postscript printers are famous for being really fast ;-)
___
Haskell-Cafe mailing list
Dan Piponi [EMAIL PROTECTED] wrote:
http://developer.nvidia.com/object/cuda.html
It's a C compiler with multiprocessor streaming extensions that
targets nvidia cards.
Whoa :-O Cool :-)
But it's not that simple...
Few things are ;-) Whats the catch? Can we use a graphics-card as an
n-core
Hello Miguel,
Thursday, August 30, 2007, 9:40:08 AM, you wrote:
What about running Haskell on a PostScript printer? PostScript IS
Turing-complete.
it would be cool to port SOE graphics to PostScript engine :)
--
Best regards,
Bulatmailto:[EMAIL PROTECTED]
Hello Hugh,
Thursday, August 30, 2007, 11:01:02 AM, you wrote:
But it's not that simple...
Few things are ;-) Whats the catch? Can we use a graphics-card as an
n-core machine, where n = 1024?
no. it's more like 8-16 cores with 64-element SSE instructions
Hi,
there's something I don't get about interaction among OS processes and
Haskell handles/channels.
Suppose I have a very small program that takes a line and prints it
till you write quit:
main = do
s - getLine
case s of
quit - putStrLn quitting return ()
_ - loop s
where
So, according to the blurb, and since this is product-specific, I dont
know if this is allowed on the newsgroup?, but it does seem to be a
fairly unique product? :
- this technology works on GeGForce 8800 cards or better
- there's a dedicated processing unit available called the Tesla,
which is
Hello Hugh,
Thursday, August 30, 2007, 2:46:51 PM, you wrote:
- this technology works on GeGForce 8800 cards or better
afaik, on any 8xxx cards - the only difference is number of threads
- 128 thread processor
it's the same as 8800GTX. please read CUDA manual first. these 128
threads are
Simon Peyton-Jones wrote:
GHC does some constant folding, but little by way of strength reduction, or
using shifts instead of multiplication. It's pretty easy to add more: it's all
done in a single module. Look at primOpRules in the module PrelRules.
Although it isn't done at the Core
On Thu, Aug 30, 2007 at 11:03:35AM +0400, Bulat Ziganshin wrote:
Hello Miguel,
Thursday, August 30, 2007, 9:40:08 AM, you wrote:
What about running Haskell on a PostScript printer? PostScript IS
Turing-complete.
it would be cool to port SOE graphics to PostScript engine :)
I spent
I managed it in 7 seconds (on 1500 MHz) with an idea close to yours
(but I used IntSet, not IntMap), Daniel Fisher gave you some good
ideas to achieve it, the real snail in this problem is the sumDivisors
function.
--
Jedaï
___
Haskell-Cafe mailing
On Fri, 2007-08-24 at 11:58 +0200, Malte Milatz wrote:
Peter Verswyvelen [EMAIL PROTECTED]:
However, in the code below the blue and green triangle should render on top
of each other, but the green triangle is rendered incorrectly.
Being a newbie, I hesitate to file a bug report... Can
On Aug 30, 2007, at 2:34 , Radosław Grzanka wrote:
obsolete and Pocket PC is probably better target. Anyway, does anyone
else experience a feeling that at the time of buying yourself new
gadget you are already in deprecated zone? ;)
I've been feeling that way since 1982
--
brandon s.
On Aug 30, 2007, at 3:00 , Hugh Perkins wrote:
On 8/30/07, Miguel [EMAIL PROTECTED] wrote:
What about running Haskell on a PostScript printer? PostScript IS
Turing-complete.
Yes, because postscript printers are famous for being really fast ;-)
You youngsters don't remember when
On Fri, 2007-08-24 at 12:31 +0200, peterv wrote:
Anyway, SOE is great for learning Haskell, but it lacks a couple of
fundamental functions to make it really attractive, like:
- Support for images
- Support for rendering to an “offscreen graphics surface” and
reading the pixels
That's great (really, thank you for such a fun example of Arrow
programming), but isn't the (*) on line two of mapPair supposed to be a
point? How would you make a point-less version of mapPair that
actually had the type signature (a-a-a)-[a]-[a]*? (For that matter,
/would/ you?)
Devin
*
On 8/30/07, Bulat Ziganshin [EMAIL PROTECTED] wrote:
it's the same as 8800GTX. please read CUDA manual first. these 128
threads are not independent, each 8 or 16 threads execute the same
code
H, yes you are right. The GPU contains 8 multiprocessors, where
each multiprocessor contains
2007/8/30, Chaddaï Fouché [EMAIL PROTECTED]:
I managed it in 7 seconds (on 1500 MHz) with an idea close to yours
(but I used IntSet, not IntMap), Daniel Fisher gave you some good
ideas to achieve it, the real snail in this problem is the sumDivisors
function.
I put my final solution on the
On 8/30/07, Peter Hercek [EMAIL PROTECTED] wrote:
f x =
let x = x * scale in
let x = x + transform in
g x
Why are you trying to call three different things by the same name 'x'
in one tiny block of code? That's very confusing and makes it hard to
reason equationally about the code.
On 8/30/07, Peter Hercek [EMAIL PROTECTED] wrote:
Hi,
I find the feature that the construct let x = f x in expr
assigns fixed point of f to x annoying. The reason is that
I can not simply chain mofifications a variable like e.g. this:
f x =
let x = x * scale in
let x = x +
1 f x =
2let x = x * scale in
3g x
Hmmm ... just assume that the scope of the x on line 3 (which
hides the x from the higher level scope is extended from line 3 to
the beginning part of line 2 (from line start to the equal sign).
OCAML does it. Let before in Clean does it too. Does
On Thu, 2007-08-30 at 18:17 +0200, Peter Hercek wrote:
I find the feature that the construct let x = f x in expr
assigns fixed point of f to x annoying.
Any alternative? Non-recursive assignments?
f x =
let x = x * scale in
let x = x + transform in
g x
I think it is often it
On 8/30/07, Brent Yorgey [EMAIL PROTECTED] wrote:
The way to combine functions into a pipeline is by using function
concatenation:
Oops, of course I meant function composition instead of function
concatenation.
-Brent
___
Haskell-Cafe mailing
On Thu, 2007-08-30 at 18:17 +0200, Peter Hercek wrote:
Hi,
I find the feature that the construct let x = f x in expr
assigns fixed point of f to x annoying. The reason is that
I can not simply chain mofifications a variable like e.g. this:
f x =
let x = x * scale in
let x = x
OK, so it's only tangentally related, but... do you have *any idea* how
many times I've written something like
let x = (some complex function of x)
in (some other complex function of x)
when in fact what I *meant* to do was type x' instead of x?!
It's really maddening to write 50,000 lines
Derek Elkins wrote:
On Thu, 2007-08-30 at 18:17 +0200, Peter Hercek wrote:
Hi,
I find the feature that the construct let x = f x in expr
assigns fixed point of f to x annoying. The reason is that
I can not simply chain mofifications a variable like e.g. this:
f x =
let x = x * scale in
It's really maddening to write 50,000 lines of code, eventually get it
to compile, run it, and have the program lock up and start consuming so
much virtual memory that the entire PC becomes unstable within seconds.
(This isn't helped by the fact that Ctrl+C doesn't seem to make either
GHCi
On Thu, Aug 30, 2007 at 06:16:12PM +0100, Andrew Coppin wrote:
Obviously you might very well have *meant* to write x = f x. But would
it be possible to add some kind of optional compiler warning to find
such assignments? It can be a nightmare trying to track down where you
made the
On 8/30/07, Andrew Coppin [EMAIL PROTECTED] wrote:
Obviously you might very well have *meant* to write x = f x. But would
it be possible to add some kind of optional compiler warning to find
such assignments?
The thing that convinced me to learn Haskell in the first place was
the fact that you
Andrew Coppin wrote:
OK, so it's only tangentally related, but... do you have *any idea*
how many times I've written something like
let x = (some complex function of x)
in (some other complex function of x)
when in fact what I *meant* to do was type x' instead of x?!
I try not to use
Another interesting example of the x = f x use :
coins = [1,2,5,10,20,50,100,200]
beautiful = foldl (\without p -
let (poor,rich) = splitAt p without
with = poor ++
zipWith (++) (map (map (p:)) with)
Hi!
I am a novice in Haskell, and particularly I have interested in generic
programming. This interest motivated me to read paper Scrap your
boilerplate: A practical design pattern for generic programming, but I
didn't understand the type of the function gfoldl, that was present in class
Term
Peter Hercek wrote:
So the question is what am I missing? Any nice use cases where
fixed point search is so good that it is worth the trouble with
figuring out new and new variable names for essentially the same
stuff?
When I write functional code, I do find myself writing recursions much
F# and Concurrent Clean introduced special syntax for doing this. Basically
they just invent new names for you.
In Haskell (warning: I'm a newbie, so take this with a grain of salt), I
guess you just use monads if you want to pass a value from one function to
another under some context, or you
On Wed, 2007-08-29 at 10:05 -0400, Thomas Hartman wrote:
Ah ok, so I did
echo :main build -v3 | /usr/local/bin/ghci-6.7.20070816 Setup.hs
1build.out 2build.err
and this does indeed seem more informative. advice?
Turns out this was a bug in FilePath that Cabal was hitting. The bug was
Although I'm sure a lot can be done on modern GPU's (especially the DirectX
10 cards = Nvidia 8x00, that can write back to main memory, called geometry
shaders), a Playstation 3 runs Linux, doesn't cost a lot, and it has 7 CPUs
running at 3+ GHz, and 6 of these have parallel vector processing
Hi all,
Does anyone know how to specify proxy server and port for darcs to use when
it connects to servers? I am behind firewall most of the time and all
requests have to go through a proxy.
Thanks,
Ed
___
Haskell-Cafe mailing list
An early proposal for the FFI supported importing functions directly from
dynamic link libraries:
www. http://www.haskell.org/hdirect/ffi-a4.ps.gz
haskell.org/hdirect/ffi-a4.ps.gz
This looks like it was dropped from the final version of the addendum in
favor of C header files as the sole
Chad Scherrer wrote:
Is it possible to write a function
redirect :: Handle - IO () - IO ()
so that redirect h action is just like action, except that all the
output written to stdout now gets sent to h instead?
No. The file descriptor used for IO is wired into a Handle, just as in
a FILE *
On Thu, 30 Aug 2007, Peter Verswyvelen wrote:
infixl 0 \ -- I just took the first weird symbol combination that came to
mind, this does not mean anything (I hope ;-)
x \ fx = fx x
f x = x * scale \ \x -
x + transform \ \x -
g x
like this you don't have to invent new names,
If you are on linux (I'm on ubuntu) you should be able to set
export http_proxy=http://proxyserver.com:1234
export https_proxy=http://proxyserver.com:123
vars, per what your sysadmin says. In my case, these are set to the same
var that permits me to use firefox via the proxy, in firefox -
Brent Yorgey wrote:
It's really maddening to write 50,000 lines of code, eventually get it
to compile, run it, and have the program lock up and start
consuming so
much virtual memory that the entire PC becomes unstable within
seconds.
(This isn't helped by the fact
David Roundy wrote:
On Thu, Aug 30, 2007 at 06:16:12PM +0100, Andrew Coppin wrote:
Obviously you might very well have *meant* to write x = f x. But would
it be possible to add some kind of optional compiler warning to find
such assignments? It can be a nightmare trying to track down where
Dan Piponi wrote:
On 8/30/07, Andrew Coppin [EMAIL PROTECTED] wrote:
Obviously you might very well have *meant* to write x = f x. But would
it be possible to add some kind of optional compiler warning to find
such assignments?
The thing that convinced me to learn Haskell in the first
Chaddaï Fouché wrote:
But, even more trivial... You use this all the time when you define
recursive function, you know ? You would need to add a rec keyword
to the language if you disallowed this.
Great and new reason too. Trying to make a difference based on presence
of formal argument would
happs on ghc 6.7 won't work because of dependency on Data.Binary, since
everything that depends on Data.Binary is broken at present.
This is for Data.Binary installed via cabal from darcs get --partial
http://darcs.haskell.org/binary . Cabal installed without any errors, but
perhaps there
On 8/30/07, Andrew Coppin [EMAIL PROTECTED] wrote:
Yeah, but... programs aren't like mathematics. I know people claim that
they are, but they aren't.
But the raison d'etre of Haskell is to make programming more like
mathematics. That motivates everything from the fact that it's a
declarative
Dan Piponi writes:
In mathematics, if you write x = f y you mean that these two
expressions are equal. In Haskell, if you say x = f y you mean *make*
then equal!
Haskell is a declarative language, not an imperative language. When
you write x = f x in Haskell, you're declaring to the
On 8/30/07, [EMAIL PROTECTED]
[EMAIL PROTECTED] wrote:
Dan Piponi writes:
In Haskell, there is no box.
Well, there are boxes...
But there also thunks and latent, yet-unevaluated graphs...
But the point of Haskell is to provide an abstraction that hides these
details from you. (Though
On Thu, 2007-08-30 at 23:58 +0200, [EMAIL PROTECTED]
wrote:
Dan Piponi writes:
In mathematics, if you write x = f y you mean that these two
expressions are equal. In Haskell, if you say x = f y you mean *make*
then equal!
Haskell is a declarative language, not an imperative
I darcs pulled cabal head to get latest cabal, removed -Werror from
GHC-Options in the cabal file, removed HsRegexPosixConfig.h and tried
again with the same result.
It seems to really want that file. With, it installs, without, no install.
$ darcs whatsnew
{
hunk ./regex-posix.cabal 16
What is so bad about
f x = g x''
where x'' = x' + transform
x' = x * scale
(if you really hate inventing temporary names, that is).
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Thank you so much. That works nicely!!
Ed
On 8/30/07, Thomas Hartman [EMAIL PROTECTED] wrote:
If you are on linux (I'm on ubuntu) you should be able to set
export http_proxy=http://proxyserver.com:1234
export https_proxy=http://proxyserver.com:123
vars, per what your sysadmin says. In my
Just so nobody else has to look it up:
Data.Generics.Basics.gfoldl :: Data a = (c (a - b) - a - c b) - (g - c
g) - a - c a
-- ryan
On 8/30/07, Rodrigo Geraldo [EMAIL PROTECTED] wrote:
Hi!
I am a novice in Haskell, and particularly I have interested in generic
programming. This interest
Actually, it's a higher rank type and that doesn't show up on hoogle's main
page.
gfoldl :: (forall a b . Data a = c (a - b) - a - c b)
- (forall g . g - c g)
- a
- c a
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 2007-08-30, Andrea Rossato [EMAIL PROTECTED] wrote:
Hi,
there's something I don't get about interaction among OS processes and
Haskell handles/channels.
This looks like a buffering problem. You might be able to make it work by
explicitly setting line buffering with hSetBuffering
--
On 8/31/07, Dan Piponi [EMAIL PROTECTED] wrote:
Right. But the functions and data that we are trying to map and fold
could be anything, so we are required to have the full functionality
of Haskell running on the GPU - unless the compiler can smartly figure
out what should run on the GPU and
57 matches
Mail list logo
