Don Stewart wrote:
jstrait:
Hi all,
I'm upgrading HAppS from my 0.9.2 to the current 0.9.2.1 in Hackage.
Some HAppS components have built and installed (IxSet and Util).
Halfway through the HAppS-State build, the GHC runtime linker gives a
fatal error on finding a duplicate definition
(CC'd to the list)
On 07/03/2008, Dusan Kolar [EMAIL PROTECTED] wrote:
I'm just wondering what algorithms you use for analysis. For instance,
clique is an NP complete problem. Do you use some approximation? If yes,
which? I'm particularly interested in the algorithm.
I haven't gotten that
Hello All,
Emping 0.4, a utility which can derive heuristic rules from facts in
Open Office Calc spreadsheet .csv format, has been released on
HackageDB.
Version 0.4 supports blank fields, treated as 'none of the others',
which allows for split attribute values. For example, Owns Car could
have
On Fri, 2008-03-07 at 00:59 -0800, Jon Strait wrote:
Don Stewart wrote:
jstrait:
Hi all,
I'm upgrading HAppS from my 0.9.2 to the current 0.9.2.1 in Hackage.
Some HAppS components have built and installed (IxSet and Util).
Halfway through the HAppS-State build, the GHC
Ivan Miljenovic [EMAIL PROTECTED] writes:
Can anyone think of any other kind of functions that would be useful
in this kind of source code analysis?
Sometimes, it's not obvious where to draw boundaries between modules,
perhaps finding a smallest cut (if that is the correct term) could
help to
On Fri, Mar 7, 2008 at 1:45 AM, Ivan Miljenovic
[EMAIL PROTECTED] wrote:
Can anyone think of any other kind of functions that would be useful
in this kind of source code analysis?
Will you be considering parallel programs? Also, perhaps some
information flow analysis would be interesting.
On 07/03/2008, Arnar Birgisson [EMAIL PROTECTED] wrote:
Will you be considering parallel programs? Also, perhaps some
information flow analysis would be interesting.
What do you mean by parallel programs? The parallelism hints used by
ghc? In that case, I'll be supporting whatever the parser
On 07/03/2008, Ketil Malde [EMAIL PROTECTED] wrote:
Sometimes, it's not obvious where to draw boundaries between modules,
perhaps finding a smallest cut (if that is the correct term) could
help to minimize the interfaces? I.e. find tightly connected
components that have relatively few
On Fri, Mar 7, 2008 at 12:42 PM, Ivan Miljenovic
[EMAIL PROTECTED] wrote:
On 07/03/2008, Arnar Birgisson [EMAIL PROTECTED] wrote:
Will you be considering parallel programs? Also, perhaps some
information flow analysis would be interesting.
What do you mean by parallel programs? The
On Fri, Mar 07, 2008 at 08:07:57AM +0100, Tom Schrijvers wrote:
Am I correct in thinking this would have worked if it were an
associated type instead of an associated type synonym?
ie,
class C a where
data T a
val :: T a
Yes, you are. Associate data type constructors (as well as
Hi all,
I'm trying to do some standard socket stuff using the
Network.Socket library. This example is a UDP server:
import Network.Socket
proto_udp :: ProtocolNumber
proto_udp = 17
port = 10162
main = do s - socket AF_INET Datagram 17
bindSocket s (SockAddrInet (PortNum port)
On Fri, Mar 7, 2008 at 8:10 AM, Scott Bell [EMAIL PROTECTED] wrote:
my test program. The Haskell version, however, does not
return from recvFrom. I've also tried wrapping this in a
withSocketsDo, with no effect.
So this is a long standing, ah, issue with the Network modules.
Try sending a
Adam,
This does the trick, thanks! I certainly would not have been
able to track down such an insidious `issue' without much
agony and despair.
- Scott
On Fri, Mar 7, 2008 at 10:48 AM, Adam Langley [EMAIL PROTECTED] wrote:
On Fri, Mar 7, 2008 at 8:10 AM, Scott Bell [EMAIL PROTECTED] wrote:
On Fri, Mar 7, 2008 at 2:10 AM, Ryan Ingram [EMAIL PROTECTED] wrote:
I don't think the cost is that great; the compiler can easily flag
polymorphic functions that require type information for some or all
arguments and in many cases the type evidence can be passed
just-in-time when calling
Hello Adam,
Maybe you could use the binary package [1] to always encode the portNumber,
etc. in network byte order? Such as available put/get functions:
putWord16be :: Word16 - Put
Hope this helps...
__
Donnie
1. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/binary-0.4.1
On
On Fri, Mar 07, 2008 at 10:56:32AM -0700, Scott Bell wrote:
Adam,
This does the trick, thanks! I certainly would not have been
able to track down such an insidious `issue' without much
agony and despair.
(haskell-cafe, my apologies for a message that's only tangentially
on-topic. The
Adam Langley [EMAIL PROTECTED] writes:
On Fri, Mar 7, 2008 at 8:10 AM, Scott Bell [EMAIL PROTECTED] wrote:
my test program. The Haskell version, however, does not
return from recvFrom. I've also tried wrapping this in a
withSocketsDo, with no effect.
So this is a long standing, ah, issue
On Fri, Mar 7, 2008 at 11:04 AM, Benedikt Schmidt [EMAIL PROTECTED] wrote:
The PortNumber type is an instance of Num, so it works if you do not
use the PortNum constructor.
Prelude Network.Socket case 10162 :: PortNumber of PortNum p - p
45607
And there was the trick that I've been
Hello Adam,
After taking a closer look, the network module does do the ntohs() FFI call:
http://haskell.org/ghc/docs/latest/html/libraries/network/src/Network-Socket.html#PortNumber
Thus, I think the issue is probably that Scott's UDP Client does not do the
htons() for the port number, or if the
Thanks for everyone's help on the list re my Haskell woes with the latest
visualization effort. I've been making my code more generic for the last
week, and I plan on releasing a visualization framework back to the
community at some point. Gotta get approval from my boss before releasing
code
On Mar 7, 2008, at 11:46 AM, Adam Langley wrote:
And there was the trick that I've been missing all this time ;) I'll
probably submit a documentation patch for this since I'm a Bear of
Little Brain and this wasn't obvious to me.
That would be great - I have been doing the same thing, and
On Fri, Mar 7, 2008 at 4:04 PM, Benedikt Schmidt [EMAIL PROTECTED] wrote:
The PortNumber type is an instance of Num, so it works if you do not
use the PortNum constructor.
Prelude Network.Socket case 10162 :: PortNumber of PortNum p - p
45607
Considering that PortNumber implements
jefferson.r.heard:
Thanks for everyone's help on the list re my Haskell woes with the latest
visualization effort. I've been making my code more generic for the last
week, and I plan on releasing a visualization framework back to the
community at some point. Gotta get approval
On 2008.03.06 22:43:53 +0100, Johannes Waldmann [EMAIL PROTECTED] scribbled
1.4K characters:
In practice, Data.Map outperforms it in essentially all cases
(Data.HashTable stops working beyond a certain size and so any
asymptotic benefits, if they exist at all, don't have time to kick
in).
The Portland Functional Programming group is meeting again this
Monday, March 10, at 7 p.m. Join us!
-- Forwarded message --
From: Igal Koshevoy [EMAIL PROTECTED]
Date: Fri, Mar 7, 2008 at 11:26 AM
Subject: [pdxfunc] pdxfunc meeting: Monday, March 10, 7pm, CubeSpace
To: Igal
Dear list,
I'm using STUArray in some of my time critical number
crunching code. I would like to know some way to catch the
exceptions raised in the ST monad, ie. ArrayException.
Looking through the Control.Exception module, I understand
that those functions can only be used within IO monad. So
26 matches
Mail list logo
