Hello,
is there any group or person working on this topic in Haskell?
I'm massaging some code for an autonomous agent, and I'd like to share ideas.
Enrico
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Duncan Coutts wrote:
Most toolkits with a main loop system allow you to setup timers. In the
Gtk2Hs bindings we can use this trick:
-- 50ms timeout, so GHC will get a chance to scheule about 20 times a second
-- which gives reasonable latency without the polling generating too much
-- cpu
On 7/23/05, Duncan Coutts [EMAIL PROTECTED] wrote:
On Wed, 2005-07-20 at 16:10 +0100, Simon Marlow wrote:
On 20 July 2005 14:35, John Goerzen wrote:
I'm looking at packaging an event-driven console widget set (CDK) for
Haskell using FFI. I know that other event-driven widget sets have
On Mon, 2005-08-22 at 15:45 +0200, Sebastian Sylvan wrote:
I haven't found any issues with wxHaskell misbehaving when it's called
from different threads, but I'd like to know for sure that it's
actually honest-to-goodness thread safe. So does anyone know?
Actually here's an even more direct
Hi,
I am getting a pattern match failure, and then a function
which worked right works wrong. I am using Hugs and Trex.
While most of the other functions in my module work fine, the function
findCoordinatesUtil generates an error, then misbehaves. The function
takes a record and a list of
From: Keean Schupke [mailto:[EMAIL PROTECTED]
Still I now know that HaskellDB has significant limitations, and the
relational algebra approach I took is far more robust and flexable...
... there's no documentation. If anyone were interested in
using/contributing I could give CVS access
From: Brian Strand [mailto:[EMAIL PROTECTED]
Reviewing at the bind variable code has highlighted a
glaring design flaw:
you can only pass homogenous lists of bind values!
I was wondering about that; I thought maybe you just passed
everything to OCI
as String and let Oracle sort
Hi,
Basically, my program has 7 threads for 7 rules
Rule1
Rule2
..
..
..
and they all use pattern-mattching (a rule MUST be evaluated by a thread)
The problem is there are some overlapping rules, which match the same
pattern and diifferent rules are likely to give different results (one
On 8/22/05, Duncan Coutts [EMAIL PROTECTED] wrote:
On Mon, 2005-08-22 at 15:45 +0200, Sebastian Sylvan wrote:
I haven't found any issues with wxHaskell misbehaving when it's called
from different threads, but I'd like to know for sure that it's
actually honest-to-goodness thread safe. So
Ah ha. That'll do.
Lesson: avoid hidden space leaks in monads.
Hmm, I'm still missing something. It seems a good lesson, but
practically speaking, it doesn't help me any more than saying write
efficient programs. What could I have looked for in the original code
to predict it may be leaky? Is
On Mon, 2005-08-22 at 18:13 +0200, Sebastian Sylvan wrote:
On 8/22/05, Duncan Coutts [EMAIL PROTECTED] wrote:
On Mon, 2005-08-22 at 15:45 +0200, Sebastian Sylvan wrote:
I haven't found any issues with wxHaskell misbehaving when it's called
from different threads, but I'd like to know
Michael Vanier [EMAIL PROTECTED] wrote in article [EMAIL PROTECTED] in
gmane.comp.lang.haskell.cafe:
Basically, though, the Haskell implementation _is_ the category theoretic
definition of monad, with bind/return used instead of (f)map/join/return as
described below.
Doesn't the Haskell
On 22/08/05, Chung-chieh Shan [EMAIL PROTECTED] wrote:
Michael Vanier [EMAIL PROTECTED] wrote in article [EMAIL PROTECTED] in
gmane.comp.lang.haskell.cafe:
Basically, though, the Haskell implementation _is_ the category theoretic
definition of monad, with bind/return used instead of
Simon,
I believe there may be some nasty interactions with generalized
newtype-deriving, since we can construct two Leibniz-equal types which
are mapped to different types using fundeps:
class Foo a where
foo :: forall f. f Int - f a
instance Foo Int where
foo = id
newtype Bar =
Chad.Scherrer:
Ah ha. That'll do.
Lesson: avoid hidden space leaks in monads.
Hmm, I'm still missing something. It seems a good lesson, but
practically speaking, it doesn't help me any more than saying write
efficient programs. What could I have looked for in the original code
to
At 3:39 PM + 8/22/05, Dinh Tien Tuan Anh wrote:
Hi,
Basically, my program has 7 threads for 7 rules
Rule1
Rule2
..
..
..
and they all use pattern-mattching (a rule MUST be evaluated by a thread)
The problem is there are some overlapping rules, which match the
same pattern and diifferent
Hi,
I am getting a pattern match failure, and then subsequent functions
which worked right work wrong. I am using Hugs and Trex. While most of
the other functions work fine, the function findCoordinatesUtil
generates an error, then misbehaves; it takes a record and searches a
list of records
17 matches
Mail list logo
