That stuffed me up for a bit. I wrote some ugly template haskell a while back
to automatically generate XmlPickler instances. can send to you if you want
On Dec 23, 2009, at 7:55 AM, Tony Morris wrote:
Adding (a_remove_whitespace,v_1) as a parser option when running solves
it. Silly me.
Tom Tobin wrote:
Heinrich Apfelmus wrote:
Likewise, ~/Library/Haskell seems to be the best place for user installs.
While I don't mind the /Library/Haskell path for global installs, I'm
not sure how I feel about this for local installs. It usually drives
me crazy when my more Unix-y
Hi,
I guess I should report this? Previously, this program got a signal 11,
and that happened somewhat later in the process, so I'm not sure how
reproducible it is. Source and data is available, if it is of any
interest.
(This is using the GHC currently shipped with Ubuntu 9.10.)
xml2x3prof:
Hi! I have some trouble implementing single-linkage clustering algorithm by
using a minimum-spanning tree, so I would appreciate if some of you could
give me some advise.
I am implementing a single-linkage clustering algorithm, and my approach is
to use minimum spanning trees for that task. I am
Max Cantor wrote:
That stuffed me up for a bit. I wrote some ugly template haskell a while back
to automatically generate XmlPickler instances. can send to you if you want
I recall typLAB writing about generic XML picklers:
http://blog.typlab.com/2009/11/writing-a-generic-xml-pickler/
Hi,
I'm facing the following problem. I've got come computation
c :: a - Reader e b
that i'm running on several as:
mapM c xs
A natural optimisation of this program would to be to take advantage of
Control.Parallel to run these computation in parallel, which seems sound
since the Reader
Nikolas Borrel-Jensen nikolasbor...@gmail.com writes:
I have very hard to see, how this could be done efficiently without pointers
(as in C). I have thought of just saving the nodes from the start of the
root path, and traversing it, but a lot of searching should be done all the
time.
I must
I see no problem. I would generate a frequency and a volume control
curve for each channel and apply this to the played instrument, then I
would mix it.
Yes, that's basically what I do now: I flatten the song into a series of
play states where for each active channel I store the pointer to the
OK thanks,
Bas
On Wed, Dec 23, 2009 at 10:50 AM, Simon Peyton-Jones
simo...@microsoft.com wrote:
Ah I see. It's an oversight. Thank you for pointing that out.
I'll fix it, but it'll be in the HEAD not 6.12.
Simon
| -Original Message-
| From: Bas van Dijk
i dont know any calculus-thingy, this is what i did:
reMatr a = Matr . a . unMatr
reMatr a = Matr . (. unMatr) a
reMatr a = Matr . (flip (.) unMatr) a
reMatr = Matr . (flip (.) unMatr)
as http://old.nabble.com/pointfree-trouble-td26881661.html#a26889388 Daniel
pointed out, this doesnt work
Hi,
I just released the first version of my Haskell Neural Network library. It
provides the very minimal features anyone would need in a neural network
library. It has yet to be completed (regarding the features) and there are
some ways for opitmizations.
Though, I'd be very glad to hear from
Am Mittwoch 23 Dezember 2009 14:40:46 schrieb slemi:
i dont know any calculus-thingy, this is what i did:
reMatr a = Matr . a . unMatr
reMatr a = Matr . (. unMatr) a
reMatr a = Matr . (flip (.) unMatr) a
You need to be aware of the implicit parentheses, that is
Matr . ((flip (.) unMatr) a)
Can anyone tell me what command line options I need to build a simple
example using OpenCLRaw on MacOSX (ghc 6.10.4)? Using -framework
OpenCL reduces the missing symbols down to just _clGetProgramInfo but
I can't see how to eliminate that last one. Has anyone else played
with OpenCLRaw?
--
Dan
I would like to generate Haskell data types and xml serialization code from
xsd. I know of DtdToHaskell but unfortunately I yet to be able to generate
a valid dtd from my xsd. Is there a way to generate Haskell from a xsd?
-Jonathan
___
I don't think such a tool exists. I think it would be a great
contribution if someone decides to create one.
Best
Keith
On Wed, Dec 23, 2009 at 12:34 PM, jonathangfisch...@gmail.com wrote:
I would like to generate Haskell data types and xml serialization code from
xsd. I know of DtdToHaskell
Any interest in helping build the tool?
-Jonathan
On Dec 23, 2009 10:00am, Keith Sheppard keiths...@gmail.com wrote:
I don't think such a tool exists. I think it would be a great
contribution if someone decides to create one.
Best
Keith
On Wed, Dec 23, 2009 at 12:34 PM,
I'd like to help... I'm not an expert in Haskell, but I guess I could help
somehow...
Hector Guilarte
-Original Message-
From: jonathangfisch...@gmail.com
Date: Wed, 23 Dec 2009 18:11:21
To: Keith Sheppardkeiths...@gmail.com; jonathangfisch...@gmail.com
Cc: haskell-cafe@haskell.org
Yes I'm interested in helping too. It's hard for me to know how much
time I'll have but my other side proj is starting to wind down now.
Maybe a wiki planning page and a patch-tag (or any other repo site
really) workspace is a good starting point?
Sent from my iPhone
On Dec 23, 2009, at
Disclaimer: this is an Xmas gift as opposed to serious stuff.
http://professor-fish.blogspot.com/2009/12/major-breakthrough-in-image-processing.html
Greetings,
Ralf
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Cool, glad to hear there is interest. I'm talking to a few other people
that are expressing interest to. I still don't have access to the haskell
wiki, but putting a page up there seems like a start. Any other suggestions
for wiki page sites?
-Jonathan
On Dec 23, 2009 11:57am, Keith
Hi Jason,
I believe the original purpose of IsString was to enable writing of
DSL's, much like described in this paper:
http://portal.acm.org/citation.cfm?id=1411236
As such, you might find far more uses of IsString inside DSL's, some
of which are likely to remain private. It was never designed
Hello;
I am writing some vectorized code, and I wondered exactly which types can
be used in DPH? Is it true one cannot use data constructors and recursive
types?
Thanks,
-Jamie
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Wed, 2009-12-23 at 00:14 +0100, Bardur Arantsson wrote:
Hi all,
Sorry about the inflammatory title, but I just got this message from an
uploaded package (hums):
Warning: This package indirectly depends on multiple versions of the
same package. This is highly likely to cause a
Hello,
Some months ago I uploaded a little package called 'repr' to hackage.
I've now updated the package to work with ghc-6.12.1 and its new base
library 4.2.0.0. Back then I forgot to make a proper announcement so I
will do that now:
'repr' allows you to render overloaded expressions to their
Hello,
I just released a minor update to my explict-iomodes package:
http://hackage.haskell.org/package/explicit-iomodes-0.1.2
Changes:
* Tested with ghc-6.12.1 and base-4.2.0.0
* Re-exported 'isEOF' from System.IO which I forgot in the previous version.
* Internal changes: Explicit imports
Hello,
I just released usb-safe-0.4.1:
http://hackage.haskell.org/package/usb-safe-0.4.1
Changes compared to 0.3 (I didn't make an announcement for 0.4):
* Tested with ghc-6.12.1 and base-4.2.0.0.
* It turned out that an Interface can also be regarded as a scarce
resource: it needs to be
Hello,
As explained in my previous email, I generalized the DeviceRegion
monad transformer from my usb-safe package and put it in its own
package:
http://hackage.haskell.org/package/regions-0.1.0.1
Hackage does not seem to build documentation at the moment so if
you're interested please look at
On Tuesday 16 June 2009 23:50:45 Richard O'Keefe wrote:
I've now done some benchmarks myself in C, Java, and Smalltalk,
comparing imperative versions of leftist heaps with functional ones.
For what it's worth, on a 2.16GHz Intel Core 2 Duo Mac, the
coefficient in front of the log(n) part was
Where do you make use of it? :)
Andrey
--
View this message in context:
http://old.nabble.com/ANNOUNCE%3A-repr-0.3.2-tp26908749p26909005.html
Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.
___
Haskell-Cafe mailing list
I noticed on Hackage that packages that are MIT licensed show up as
OtherLicense. I took a peek inside the Cabal code, and noticed that
the License type has lines for MIT, but commented out [1]:
---- | The MIT license, similar to the BSD3. Very free license.
-- | MIT
Why is this? Both
Patai Gergely schrieb:
It is the strength of Haskell to separate everything into
logical steps and let laziness do things simultaneously. Stream fusion
can eliminate interim lists, and final conversion to storable vector
using http://hackage.haskell.org/package/storablevector-streamfusion/
On Wed, Dec 23, 2009 at 1:27 PM, jonathangfisch...@gmail.com wrote:
Cool, glad to hear there is interest. I'm talking to a few other people that
are expressing interest to. I still don't have access to the haskell wiki,
but putting a page up there seems like a start. Any other suggestions for
Ok here we go http://code.google.com/p/xsdtohaskell/
On Wed, Dec 23, 2009 at 4:25 PM, Rogan Creswick cresw...@gmail.com wrote:
On Wed, Dec 23, 2009 at 1:27 PM, jonathangfisch...@gmail.com wrote:
Cool, glad to hear there is interest. I'm talking to a few other people
that
are expressing
Am Donnerstag 24 Dezember 2009 02:14:51 schrieb Michael Lesniak:
Hello haskell-cafe (and merry christmas!),
I have a strange problem with the garbage collector / memory which I'm
unable to find a solution for. I think the source of my problems has to do
with lazy evaluation, but currently I'm
Hi Nikolas,
Interesting problem. I'd do something like the following, where
the initial spanning tree from you example (re-tree-ified) is:
{-
ghci :t t
t :: Tree (Id, Cost)
g
ghci ppT t
(4,0)
|
+- (3,1)
| |
| `- (1,1)
|
`- (2,3)
|
`- (5,12)
-}
and which results in the tree:
{-
ghci let
For completeness, you might then do the actual clustering something like:
import Data.Tree
import Data.List
import Data.Function
-- ... code from before ...
cluster :: Ord cost
= (a - b)
- (a - cost)
36 matches
Mail list logo
