You might want to depend on Conal Elliott's vector-space library
rather than implement your own vector space class. Then you don't need
the associated datatype which might allow simpler datatypes for
colours and vectors.
Also Conal's library is quite well used, so it does mean the operator
names
From: Gregory Collins g...@gregorycollins.net
On Mon, Apr 11, 2011 at 3:55 PM, Serguei Son serguei@gmail.com
wrote:
So if I must use a safe function returning IO a,
there is no way to improve its performance? To give you
a benchmark, calling gsl_ran_ugaussian a million times
in
Maciej Marcin Piechotka uzytkown...@gmail.com wrote:
Does someone know a cleaner, more elegant solution? Encapsulating the
state in the iteratee's input type is not an option.
The first thing that come to my mind.
runWithState :: Iteratee a (StateT s m) b - s - Iteratee a m (b, s)
Hi,
In order to do a performance comparison beetween different approaches for
our application, I make different implementation of a simple example
(computing the norm of a vector expression.
I rely on Repa to do this.
However, when I tried to build the parallel version (-threaded -fvectorise
On Monday 11 April 2011 8:31:54 PM Leon Smith wrote:
I have a type constructor (Iterator i o m a) of kind (* - * - (* -
*) - *), which is a monad transformer, and I'd like to use the type
system to express the fact that some computations must be pure, by
writing the impredicative type
On Mon, 11 Apr 2011, Joel Burget wrote:
I should mention that I'm going to convert all the Storable instances from
something
like this:
peek p = do
w - (#peek aiQuaternion, w) p
x - (#peek aiQuaternion, x) p
y - (#peek aiQuaternion, y) p
z - (#peek aiQuaternion, z) p
Hi! I am trying to install qtHaskell on a Windows 7 machine, but I am
running into some problems while running the build script. I believe I
have followed all the steps stated in the installation instructions,
but get errors of this type:
Creating library file: ..\bin\libqtc_core.a
Dear List,
I am quite new in Haskell's categorical manner of programming. However I have
enough knowledge in Category Theory.
I want to ask a question, maybe very well-known one by some of you, about
monads of Haskell.
For
the type constructors like Maybe and [], I managed to prove that
As for Cont, it can be proved easily, either by hand, or by observation that
Cont is an obvious composition of two adjoint functors.
As for IO, it has to be taken for granted, since IO internals are hidden from
the programmer.
Отправлено с iPhone
Apr 12, 2011, в 14:39, Burak Ekici
Dear all,
I would like to collect contributions for the 20th edition of the
Haskell Communities Activities Report
http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report
On 12/04/2011, at 7:32 PM, Wilfried Kirschenmann wrote:
Hi,
In order to do a performance comparison beetween different approaches for our
application, I make different implementation of a simple example (computing
the norm of a vector expression.
I rely on Repa to do this.
However,
From: Joel Burget joelbur...@gmail.com
Subject: [Haskell-cafe] Assimp FFI Library
To: haskell-cafe@haskell.org
Message-ID: banlktimw-71ncbrqnr68kravkzyte1u...@mail.gmail.com
Content-Type: text/plain; charset=iso-8859-1
5. I've reduced a lot of boilerplate in Vec.hs by using the CPP
Repa and DPH are different projects. The compilation mechanism and approach
to parallelism is quite different between them. You only need -fvectorise to
turn on the vectoriser for DPH code. You don't need (or want) -fvectorise for
Repa programs. DPH is also still at the research prototype
John and Stephen,
Thanks for the suggestions! I'm going to evaluate them more fully to see if
they're what I'm looking for. Even though I tried looking through the vector
packages I managed to miss those (there are a lot of packages with vec in
their name).
Jason,
Wow, great suggestions! To
I think impredicative polymorphism is actually needed here; if I write
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE RankNTypes #-}
feedPure :: forall i o a. [i] - (forall m. Iterator i o m a) - (forall m.
Iterator i o m a)
feedPure = loop
where
loop :: [i] - (forall m.
On Mon, 2011-04-11 at 00:42 +0200, Svante Signell wrote:
Addressing both Haskell and Hurd people here. Any hints by anyone?
On Wed, 2011-04-06 at 09:30 +0200, Svante Signell wrote:
...
#5 0x011d3ce0 in __libc_read (fd=DWARF-2 expression error: DW_OP_reg
operations must be used either
Hello Haskellers!
I have developed a very simple logging library to be extendable and
easy-to-use. You can see the current release at
http://hackage.haskell.org/package/hlogger/. The SimpleHLogger module is
an example of what a HLogger implementation could look like. It could be
used like
On Tue, Apr 12, 2011 at 6:40 PM, Jon Kristensen
technol...@jonkristensen.com wrote:
Hello Haskellers!
As I have now implemented everything that I could think of, I would like to
ask the Haskell community to give some feedback on HLogger so that I can
continuing improving it. Some questions:
On Tue, Apr 12, 2011 at 11:40 AM, Jon Kristensen
technol...@jonkristensen.com wrote:
Hello Haskellers!
I have developed a very simple logging library to be extendable and
easy-to-use. You can see the current release at
http://hackage.haskell.org/package/hlogger/. The SimpleHLogger module is
Hi Cafe:
http://hackage.haskell.org/trac/ghc/ticket/1245
I also want some kind of syntactic sugar for H. Lists.
The absence of syntactic sugar makes heterogeneous list to look scary.
People in haskell is accostumed to syntactic sugaring, so people think of
not sugared expressions as second
On 11/04/2011 12:52 AM, Don Stewart wrote:
I'd like a proper FFI binding for getting at Stats.c dynamically. So I
can write programs that determine their own stats about the GC and so
on.
I have often wished that there was a much bigger API for interacting
with the RTS. Currently, you can
I am trying as an experiment to write something as follows:
data Wrapper a b where
Pure :: (a - b) - Wrapper a b
Nullable :: (Maybe a - b) - Wrapper a b
class Liftable a b where
liftTo :: (b - c) - a b c
instance Liftable Wrapper a where
liftTo = Pure
instance Liftable Wrapper (Maybe
On Tue, 12 Apr 2011, Edward Amsden wrote:
I am trying as an experiment to write something as follows:
data Wrapper a b where
Pure :: (a - b) - Wrapper a b
Nullable :: (Maybe a - b) - Wrapper a b
class Liftable a b where
liftTo :: (b - c) - a b c
instance Liftable Wrapper a where
liftTo
On Tue, Apr 12, 2011 at 3:13 PM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
On Tue, 12 Apr 2011, Edward Amsden wrote:
I am trying as an experiment to write something as follows:
data Wrapper a b where
Pure :: (a - b) - Wrapper a b
Nullable :: (Maybe a - b) - Wrapper a b
On Tuesday 12 April 2011 11:27:31 AM Leon Smith wrote:
I think impredicative polymorphism is actually needed here; if I write
...
Then I get a type error
...
I'm not going to worry about the type error, because that wasn't what I had in
mind for the types. The type for loop I had in mind
On Tue, Apr 12, 2011 at 12:57 PM, Alberto G. Corona agocor...@gmail.com wrote:
Hi Cafe:
http://hackage.haskell.org/trac/ghc/ticket/1245
I also want some kind of syntactic sugar for H. Lists.
The absence of syntactic sugar makes heterogeneous list to look scary.
People in haskell is
Yep, this is nice and flexible, but it is not standard. With quasiquotes
each one will create its own recipe, its own flavour and this is not good. I
would prefer something standard. The fact is that heterogeneous list are
powerful and flexible for doing unique things that are not possible with
On Tue, 12 Apr 2011 19:10:09 +0200, Gregory Collins
g...@gregorycollins.net wrote:
On Tue, Apr 12, 2011 at 6:40 PM, Jon Kristensen
technol...@jonkristensen.com wrote:
Hello Haskellers!
As I have now implemented everything that I could think of, I would
like to
ask the Haskell community
hsc2hs and c2hs are good suggestions, and some of the tutorials I'm
following use them.
But 1) Many Haskell FFI tutorials don't require them, so they only seem to
help, or only help in older versions of GHC.
And 2) When I did compile using c2hs, it just produced the same file, but
with filler
On Tue, 12 Apr 2011 12:14:50 +0200, Øystein Kolsrud kols...@gmail.com wrote:
Hi! I am trying to install qtHaskell on a Windows 7 machine, but I am
running into some problems while running the build script. I believe I
have followed all the steps stated in the installation instructions,
but get
Hi all,
I'm currently scoping out a project for work that I'd like to do
in Haskell. Basically its a HTTP proxy (ie like the Squid proxy)
but with a few wrinkles:
- Since the connecting clients are untrusted, the incoming
connection is HTTP, the header is modified by the proxy to
add
On 12/04/2011, at 11:50 PM, Wilfried Kirschenmann wrote:
surprisingly, when removing the R.force from the code you attached,
performances are better (speed-up=2). I suppose but I am not sure that
this allow for loop fusions beetween the R.map ant the R.sum.
I use ghc 7.0.3, Repa 2.0.0.3
Erik,
I have done stuff like this before in C++ and Ocaml, so the mechanics
are not a mystery. However I would like as much as possible to make
use of existing Haskell libraries to cut down the development time.
I recommend wai and warp which are available on Hackage. I asked
Michael, the
On Wed, Apr 13, 2011 at 7:02 AM, Kazu Yamamoto k...@iij.ad.jp wrote:
Erik,
I have done stuff like this before in C++ and Ocaml, so the mechanics
are not a mystery. However I would like as much as possible to make
use of existing Haskell libraries to cut down the development time.
I
34 matches
Mail list logo
