Tired of your persistence layer?
Take persistence the haskelll way. Besides the backward compatible stuff,
TCache now defines persistent STM variables (DBRef's) that leverages the
traditional haskell reference syntax to perform fast in-memory database
transactions and inter-object references. It
Hi,
As I don't know anything about Haskell, can I make a stupid question: Is
there any method to create debug symbols for a Haskell program, and is
it possible to debug with gdb?
Thanks!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Tue, Apr 12, 2011 at 11:59 PM, Svante Signell
svante.sign...@telia.com wrote:
Hi,
As I don't know anything about Haskell, can I make a stupid question: Is
there any method to create debug symbols for a Haskell program, and is
it possible to debug with gdb?
You can run gdb on a Haskell
On 13 April 2011 07:59, Svante Signell svante.sign...@telia.com wrote:
As I don't know anything about Haskell, can I make a stupid question: Is
there any method to create debug symbols for a Haskell program, and is
it possible to debug with gdb?
You cannot create debug symbols. Things that are
Jon, thanks for HLogger! For my (small) needs I was looking for a
simple logging solution, and I couldn't get HSLogger to do what I
wanted, whereas your simpleLogger fitted the bill perfectly.
I suppose a good thing would be conditional buffering, as other noted:
in development mode I want to get
Yeah, the Repa fold and sum functions just use the equivalent Data.Vector
ones. They're not parallelised and I haven't looked at the generated code.
I'll add a ticket to the trac to fix these, but won't have time to work on it
myself in the near future.
Ok.
Thank you for your help.
I
On Tue, Apr 12, 2011 at 11:45 PM, Henk-Jan van Tuyl hjgt...@chello.nl wrote:
If you want to know what the last thing was that your application was doing,
before it crashed (e.g. at the customers site), you better write every
message immediately to disk.
Yes, I suppose it would depend on your
Max and Tim,
Thank you for your replies, continuation below.
On Wed, 2011-04-13 at 08:27 +0100, Max Bolingbroke wrote:
On 13 April 2011 07:59, Svante Signell svante.sign...@telia.com wrote:
As I don't know anything about Haskell, can I make a stupid question: Is
there any method to create
Hello Svante,
I have a few recommendations, places where I'd check:
1. Consult the arguments passed to read() usign GDB (your libc has
debugging symbols) and see if they are obviously wrong. It seems
more plausible that they are something that would be right for
Linux, but not so right
Hi all
I'm using Haskell mode for Vim, as well as syntastic. I've found syntastic
particularly useful as I'm quite new to Haskell and sometimes get the types of
my functions wrong.
When working on Cabal packages however, syntastic marks import statements which
import modules local to the
On Wednesday 13 April 2011 at 1:34 PM, Luke Randall wrote:
I'm using Haskell mode for Vim, as well as syntastic. I've found syntastic
particularly useful as I'm quite new to Haskell and sometimes get the types
of my functions wrong.
When working on Cabal packages however, syntastic marks
Hi Mitar,
I have made this function to generate a random graph for
Data.Graph.Inductive library:
generateGraph :: Int - IO (Gr String Double)
generateGraph graphSize = do
when (graphSize 1) $ throwIO $ AssertionFailed $ Graph size out
of bounds ++ show graphSize
let ns = map (\n -
Thanks! The issue with eta-reduction had been confusing me...
Best,
Leon
On Tue, Apr 12, 2011 at 3:35 PM, Dan Doel dan.d...@gmail.com wrote:
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
Hi all. There's recently been some talk about distributed haskell, but what
I wish to see is interest from an experienced member of the Haskell
community in implementing Haskell components with SCA/Tuscany. Please see
this and consider it, it'd be great to be able to use Haskell in the same
2011/4/12 Burak Ekici ekcbu...@hotmail.com:
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
Adam Krauze schrieb:
Hello,
as I am newbie to Haskell and my introductory question is:
given functions say f and g with type signatures
f :: (Num a) = [a] - [a] - [(a,a)] // f takes two lists and zips them
into one in some special way
g :: (Num a) = a - [(a,a)] - [a] // g using some
Welcome to issue 177 of the HWN, a newsletter covering developments in
the [1]Haskell community. This release covers the week of April 3 to 9,
2011.
You can find a HTML rendition of this issue at: http://bit.ly/hR2sMB
Announcements
Brent Yorgey [2]sent out a call for
Hi,
The links to the supposedly brilliant Template Haskell tutorials by Bulat are
broken.
http://www.haskell.org/bz/thdoc.htm
http://www.haskell.org/bz/th3.htm
Does anyone know if these tutorials moved to somewhere else?
greetings,
Kenneth___
18 matches
Mail list logo
