I believe this might be causing problems for me with patch-tag.
me: Like mightybyte, I run my app in a shell loop that will just
restart it after a crash. But every once in a while it won't restart
because of the busy socket and I need to do a manual restart, killing
multiple processes (usually
Louis Wasserman wrote:
Yo,
Man, I'd never used FFI before, but it's really not as scary as I'd feared.
The FFI is fantastic. We can even use C higher order functions with
normal Haskell function arguments... :)
I've implemented a more comprehensive interface to GLPK's simplex solver
and
Hi,
Am Donnerstag, den 25.02.2010, 20:48 -0800 schrieb Jason Dusek:
Can you provide a link to something describing the error?
Well, here are our patches to make hmake compile:
http://patch-tracker.debian.org/package/hmake/3.14-2
And building hat results in the attached buildlog.
Greetings,
On Feb 26, 2010, at 04:28 , Thomas Hartman wrote:
me: Like mightybyte, I run my app in a shell loop that will just
restart it after a crash. But every once in a while it won't restart
because of the busy socket and I need to do a manual restart, killing
multiple processes (usually 2).
the error
I have OpenSuse 11.2 running on VMWare and I have recently installed ghc
6.10.4 from the RPM from OpenSuse. Now I want to install cabal. I have
downloaded the required packages from hackage and I try to run: runhaskell
Setup configure on any of these packages. With option -v I can see an error
Andy Gimblett schrieb:
Hi Christian,
[...]
It may make sense to use something like readMaybe (which is missing in
the Prelude) instead of read to allow the parser to fail more nicely.
It seems to be kicking up reasonable errors as it is, e.g.:
*Main parse aFloat 2e-h
Left (line 1,
Am Freitag 26 Februar 2010 12:52:36 schrieb gmi:
I have OpenSuse 11.2 running on VMWare and I have recently installed ghc
6.10.4 from the RPM from OpenSuse. Now I want to install cabal. I have
downloaded the required packages from hackage and I try to run:
In principle, just unpacking the
A type is, well, a type.
A type class is a relation between types.
The confusion probably comes from OO programming
where (interfaces) describe unary relations (= one parameter type classes).
(begin rant) I wouldn't easily give up algebraic data types
just because OO programmers don't seem
I'd say we don't really need subclasses. I mean, what's the difference:
class Eq a where (==) :: a - a - Bool
instance Eq a = Eq (Maybe a) where
Nothing == Nothing = True
Just x == Just y = x == y
_ == _ = False
sort :: Eq a = [a] - [a]
or
data Eq a = Eq {eq :: a - a - Bool}
eqMaybe ::
s/subclasses/classes/
Sorry for the confusion.
Miguel Mitrofanov wrote:
I'd say we don't really need subclasses. I mean, what's the difference:
class Eq a where (==) :: a - a - Bool
instance Eq a = Eq (Maybe a) where
Nothing == Nothing = True
Just x == Just y = x == y
_ == _ = False
sort
Thanks a lot. It was all about installing *-devel things.
--
View this message in context:
http://old.nabble.com/problem-loading-package-unix-2.3.2.0-while-installing-hackages-on-OpenSuse-tp27717114p27718263.html
Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.
A type class is a relation between types.
Yes, but not officially, just de facto:
http://hackage.haskell.org/trac/haskell-prime/ticket/90
Best,
Maurício
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Am Mittwoch 17 Februar 2010 12:17:10 schrieb Jeremy O'Donoghue:
You're probably correct about the dependencies. I have never tried to
compile wxHaskell against GHC 6.12.1
I'm waiting for Haskell Platform to be released to make the required
changes since (working primarily on Windows) I just
Hi all,
If this question sounds a bit noob-ish, that would be because I am one - so
apologies in advance!
I have functions that look something like these:
f1 :: [a] - [b]
f1 xs = [foo [x1, x2] |
x1 - xs,
x2 - bar x1,
baz x1 /= baz x2]
f2 :: [a] - [b]
f2 xs = [foo [x1, x2, x3] |
Am Freitag 26 Februar 2010 15:52:15 schrieb Ishaaq Chandy:
Hi all,
If this question sounds a bit noob-ish, that would be because I am one -
so apologies in advance!
I have functions that look something like these:
f1 :: [a] - [b]
f1 xs = [foo [x1, x2] |
x1 - xs,
x2 - bar x1,
| Am Freitag 26 Februar 2010 00:57:48 schrieb Rafael Gustavo da Cunha Pereira
| Pinto:
|
| There is a single 10 digit number that:
|
| 1) uses all ten digits [0..9], with no repetitions
| 2) the number formed by the first digit (right to left, most
| significant) is divisible by one
| 3) the
Hi Daniel,
On Fri, 26 Feb 2010 15:31 +0100, Daniel Fischer
daniel.is.fisc...@web.de wrote:
Am Mittwoch 17 Februar 2010 12:17:10 schrieb Jeremy O'Donoghue:
You're probably correct about the dependencies. I have never tried to
compile wxHaskell against GHC 6.12.1
[snip]
Beating a dead
This reminds me of an email posted to this list long ago
by Luke Palmer, describing a use of records-as-interfaces
in Agda.
--
Jason Dusek
-- Forwarded message --
From: Luke Palmer lrpal...@gmail.com
Date: 2009/12/29
Subject: Re: [Haskell-cafe] Alternatives to type
On Feb 24, 2010, at 20:51 , Ivan Miljenovic wrote:
On 25 February 2010 11:24, Don Stewart d...@galois.com wrote:
Seriously?? Doesn't that break the module system?
Maybe I misunderstood it; all I know is that Curt Sampson says he uses
this kind of stuff for testing purposes by not having to
Hello,
ErrorT instance of MonadPlus define that in case of fail both arguments of
mplus a value of Error will be the Error of second computation:
m `mplus` n = ErrorT $ doa - runErrorT mcase a of
Left _ - runErrorT nRight r - return (Right
r)
Could it
real :: Parser String
real = do
d - decimal
f - option $ do
p - char '.'
n - many1 digit
return $ p : n
Just to throw two bits in here, this is the only style that doesn't
require leaning on the space bar and squinting to line things up,
doesn't require any fancy editor
Great, thanks!
On Thu, Feb 25, 2010 at 10:29 PM, Dan Doel dan.d...@gmail.com wrote:
On Friday 26 February 2010 12:13:56 am Bryan O'Sullivan wrote:
Dan, do you think you might be releasing your port of uvector-algorithms
to
vector any time soon? I've ported mwc-random to use vector, and I'd
On Fri, Feb 26, 2010 at 04:23:52PM +0300, Miguel Mitrofanov wrote:
I'd say we don't really need subclasses. I mean, what's the difference:
class Eq a where (==) :: a - a - Bool
instance Eq a = Eq (Maybe a) where
Nothing == Nothing = True
Just x == Just y = x == y
_ == _ = False
sort
Thanks, I altered my top level request handler as follows
mysmartserver conf h stateProxy = do
socket - bindPort conf
I added (setSocketOption socket ReuseAddr 1) here
Should this be added in a comment, or even in function code,
in Happstack.Server.SimpleHTTP? What are the
Is there any way I can temporarily reassign stdout? In particular, will
this be handled well by the FFI? I'm hoping there's maybe something like
PHP's output buffering thingy http://php.net/manual/en/book.outcontrol.php.
I'm *binding* (not doing a process call) to an external library which
On Feb 26, 2010, at 14:43 , Thomas Hartman wrote:
in Happstack.Server.SimpleHTTP? What are the tradeoffs, when would you
*not* want ot use ReuseAddr?)
In the modern world, any server socket probably should use
SO_REUSEADDR. About the only modern use for the default would involve
servers
Hi all,
there's a new suite of wxHaskell on hackage,
http://hackage.haskell.org/package/wxdirect-0.12.1.2
http://hackage.haskell.org/package/wxcore-0.12.1.3
http://hackage.haskell.org/package/wx-0.12.1.3
If you have ghc-6.12.1 and wxWidgets-2.8, a simple
cabal install wx
should give you wx
Hi Kashyap,
What would be your recommendation on how to get a grasp of FoF
Well, you can read the PLOS paper first. Also, FoF is a literate code,
so hopefully the learning curve will be less steeper. You should also
take a look at the Fugu compiler literate code and, in less extend,
the Hamlet
On Feb 26, 2010, at 14:44 , Louis Wasserman wrote:
Is there any way I can temporarily reassign stdout? In particular,
will this be handled well by the FFI? I'm hoping there's maybe
something like PHP's output buffering thingy. I'm *binding* (not
doing a process call) to an external
Am Freitag 26 Februar 2010 16:50:42 schrieb Ketil Malde:
| Am Freitag 26 Februar 2010 00:57:48 schrieb Rafael Gustavo da Cunha
| Pereira
|
| Pinto:
| There is a single 10 digit number that:
|
| 1) uses all ten digits [0..9], with no repetitions
| 2) the number formed by the first digit
Daniel Fischer daniel.is.fisc...@web.de skrev:
Am Freitag 26 Februar 2010 16:50:42 schrieb Ketil Malde:
solutions = [[x1,x2,x3,x4,x5,x6,x7,x8,x9,x10]
| x1 - [0..9]
First digit can't be 0, so make it [1 .. 9].
Since you use the fact that the last digit must be the 0, pull all
Am Freitag 26 Februar 2010 21:34:28 schrieb Ketil Malde:
Daniel Fischer daniel.is.fisc...@web.de skrev:
Am Freitag 26 Februar 2010 16:50:42 schrieb Ketil Malde:
solutions = [[x1,x2,x3,x4,x5,x6,x7,x8,x9,x10]
| x1 - [0..9]
First digit can't be 0, so make it [1 .. 9].
Since
Okay, okay, I'm convinced that trying to mess with it in C is easier than in
Haskell. =P
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Fri, Feb 26, 2010 at 2:14 PM, Brandon S. Allbery KF8NH
allb...@ece.cmu.edu wrote:
On Feb 26, 2010, at 14:44 ,
This seems quite relevant:
http://lambda-the-ultimate.org/node/3837
titto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello,
It will be interesting to see if that makes any difference -- it shouldn't.
In happstack-server we use 'listenOn'. According to the documentation
listenOn already sets ReuseAddr:
http://hackage.haskell.org/packages/archive/network/2.2.1.7/doc/html/Network.html#v%3AlistenOn
A quick look
Is there a simple way to discover the answer to questions like how many
packages are on Hackage? or how many downloads per day does Hackage
serve? Or is this information not posted anywhere?
(I know there was a blog article a while back with some stats in it, but
what about the statistics
andrewcoppin:
Is there a simple way to discover the answer to questions like how many
packages are on Hackage? or how many downloads per day does Hackage
serve? Or is this information not posted anywhere?
(I know there was a blog article a while back with some stats in it, but
what
Am Freitag 26 Februar 2010 14:07:07 schrieb Johannes Waldmann:
I wouldn't easily give up algebraic data types
Nor I. Without easily defined ADTs, Haskell wouldn't be nearly so awesome.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Am Freitag 26 Februar 2010 23:57:05 schrieb Don Stewart:
501 users have uploaded 7202 versions of 1870 packages.
http://hackage.haskell.org/cgi-bin/hackage-scripts/stats
The download stats are computed occasionally, but I've not had time
since Hackage moved to the new server.
Would it
Trying to access http://hackage.haskell.org/trac/hackage I land in a
redirection loop no matter which page or which browser I try. It worked
earlier today. Has anybody an idea what the heck might be going on?
Is it just me?
___
Haskell-Cafe mailing
On Sat, Feb 27, 2010 at 01:56:34AM +0100, Daniel Fischer wrote:
Trying to access http://hackage.haskell.org/trac/hackage I land in a
redirection loop no matter which page or which browser I try. It worked
earlier today. Has anybody an idea what the heck might be going on?
Is it just me?
Works
Am Samstag 27 Februar 2010 02:15:17 schrieb Felipe Lessa:
On Sat, Feb 27, 2010 at 01:56:34AM +0100, Daniel Fischer wrote:
Trying to access http://hackage.haskell.org/trac/hackage I land in a
redirection loop no matter which page or which browser I try. It
worked earlier today. Has anybody
Indeed, the error occurs when two processes are running at the same
time. One process isn't serving anything, and the other is just
looping, reported that it can't stop because the port is taken, and
repeating ad infinitum.
The loop I have is
ulimit -v 15
while true; do
echo starting
43 matches
Mail list logo
