Hi Keith,
Thanks for pointing this out. I've no idea why it's failing, but will
check once I get home - unfortunately the machine I'm currently on
doesn't permit me to ssh in and find out.
Thanks, Neil
On Sat, Nov 28, 2009 at 6:53 AM, Keith Sheppard keiths...@gmail.com wrote:
hoogle is down
I'm currently working on a binding to Brian Gladman's C/assembler AES
implementation.
This code is sufficiently small that it makes little sense to create a
separate C library for it; furthermore, it isn't typically packaged by
the various linux distributions, never mind other OSs. As a result,
Excerpts from Simon Marlow's message of Wed Nov 18 09:55:28 +0100 2009:
On 17/11/2009 12:25, Nicolas Pouillard wrote:
Excerpts from Simon Marlow's message of Tue Nov 17 12:00:21 +0100 2009:
I've just uploaded deepseq-1.0.0.0 to Hackage
Great!
I'm wondering what is the need/purpose for
Just to provide completion to this thread, I gave up on Haskell Windows web
development after discovering that some important libraries like
network-minihttp did not compile under Windows (and I could never get FastCGI
to work properly either, although it did compile).
I'm now developing using
Hey folks,
I'm at home this weekend, and the internet is somewhat dodgey, so
I'm going to delay the special Thanksgiving episode of the HWN till
sunday afternoon...
I suppose the Turkey-coma isn't helping either, but I'll never admit
it...
/Joe
Now it's running again. Just out of curiosity, what was wrong?
2009/11/28 Neil Mitchell ndmitch...@gmail.com
Hi Keith,
Thanks for pointing this out. I've no idea why it's failing, but will
check once I get home - unfortunately the machine I'm currently on
doesn't permit me to ssh in and
Hi cafe,
Is such a thing possible,
add :: Int - Int - Int
add x y = x + y
-- a list of partially applied functions
adds = [add 3, add 5, add 7, add 3, add 5, add 8]
-- an example usage of the list
k = map (\ f - f 10 ) adds
add3s = filter (?) adds -- add3s = [add 3, add 3]
addEvens = filter
Ozgur Akgun wrote:
Hi cafe,
Is such a thing possible,
add :: Int - Int - Int
add x y = x + y
-- a list of partially applied functions
adds = [add 3, add 5, add 7, add 3, add 5, add 8]
-- an example usage of the list
k = map (\ f - f 10 ) adds
add3s = filter (?) adds -- add3s =
Hi,
Yep, it's all back now. The problem was that the server had run out of
disk space. Ian fixed it for now, but do let me know if it fails
again.
Thanks, Neil
On Sat, Nov 28, 2009 at 2:54 PM, Ozgur Akgun ozgurak...@gmail.com wrote:
Now it's running again. Just out of curiosity, what was
On Sat, 2009-11-28 at 14:47 +0100, Svein Ove Aas wrote:
I'm currently working on a binding to Brian Gladman's C/assembler AES
implementation.
This code is sufficiently small that it makes little sense to create a
separate C library for it; furthermore, it isn't typically packaged by
the
Sorry, no good.
I don't want to guess the first paramater, I really want to access it.
2009/11/28 Steffen Schuldenzucker sschuldenzuc...@uni-bonn.de
Ozgur Akgun wrote:
Hi cafe,
Is such a thing possible,
add :: Int - Int - Int
add x y = x + y
-- a list of partially applied
Answering my own question, one can achieve the goal via doing a lookup, if
the number of possible parameters is limited.
eg. assume add is a function which can only take Int's from [0..9].
Interestingly, my situation is exactly like this. I think I'll implement
such a lookup.
The question is
The question is still open though, if somebody has some magic to extract the
prameter from an applied function...
It isn't possible.
Closest solution will be a list of pairs (function,arg) and a special
apply function that takes those pairs and apply to function an
argument and.them, apply
On 28/11/09 14:04, Nicolas Pouillard wrote:
Excerpts from Simon Marlow's message of Wed Nov 18 09:55:28 +0100 2009:
On 17/11/2009 12:25, Nicolas Pouillard wrote:
Excerpts from Simon Marlow's message of Tue Nov 17 12:00:21 +0100 2009:
I've just uploaded deepseq-1.0.0.0 to Hackage
Great!
I'm
On Fri, Nov 27, 2009 at 1:05 PM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
I found that the dependency on Cairo and GTK originates from criterion. I
have to build criterion with 'cabal install -f-chart criterion'.
Unfortunately I cannot do 'cabal fetch criterion' in order to
Hi all,
I'm trying out NearlyFreeSpeech.net for hosting my Haskell apps. They use
FreeBSD 7.2, but I can't get cabal-install to compile since it runs out of
memory during the link phase. So far I haven't had trouble manually
installing packages, but it would be nice to just do cabal install...
-- Here's a expansion of the ideas presented for tracking the argument used
-- to create a partially applied function:
--
-- Based on simple pairs
--
add :: Int - Int - Int
add x y = x + y
addr :: Int - (Int, Int - Int)
addr a = (a, add a)
-- a list of partially applied functions
adds = [addr
On Sat, 2009-11-28 at 19:39 +0200, Michael Snoyman wrote:
Hi all,
I'm trying out NearlyFreeSpeech.net for hosting my Haskell apps. They
use FreeBSD 7.2, but I can't get cabal-install to compile since it
runs out of memory during the link phase. So far I haven't had trouble
manually
On Sat, 2009-11-28 at 09:29 -0800, Bryan O'Sullivan wrote:
On Fri, Nov 27, 2009 at 1:05 PM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
I found that the dependency on Cairo and GTK originates from
criterion. I have to build criterion with 'cabal install
Will the following do what you wish?
add :: Int - Int - Int
add x y = x + y
addends = [3,5,7,3,5,8]::[Int]
add3s :: [Int] - [Int - Int]
add3s addends = map add (filter (3==) addends)
k3 :: [Int]
k3 = map (\ f - f 10 ) (add3s addends)
--
Regards,
Casey
On Sat, Nov 28, 2009 at 7:56 PM, Duncan Coutts duncan.cou...@googlemail.com
wrote:
On Sat, 2009-11-28 at 19:39 +0200, Michael Snoyman wrote:
Hi all,
I'm trying out NearlyFreeSpeech.net for hosting my Haskell apps. They
use FreeBSD 7.2, but I can't get cabal-install to compile since it
Will the following do what you wish?
add :: Int - Int - Int
add x y = x + y
addends = [3,5,7,3,5,8]::[Int]
-- P for predicate
addPs :: (Int - Bool) - [Int] - [Int - Int]
addPs predicate addends = map add (filter predicate addends)
kP :: [Int]
kP = map (\ f - f 10 ) (addPs (3==) addends)
--
Duncan Coutts schrieb:
On Sat, 2009-11-28 at 09:29 -0800, Bryan O'Sullivan wrote:
On Fri, Nov 27, 2009 at 1:05 PM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
I found that the dependency on Cairo and GTK originates from
criterion. I have to build criterion with
On Sat, 2009-11-28 at 20:13 +0100, Henning Thielemann wrote:
However I have still the problem, that once criterion is installed
without gtk and cairo, then 'cabal install' still wants to download them
when I install packages that import 'criterion'. :-( Bug or feature?
That's a problem with
On Nov 28, 2009, at 12:01 , Ozgur Akgun wrote:
Answering my own question, one can achieve the goal via doing a
lookup, if the number of possible parameters is limited.
eg. assume add is a function which can only take Int's from [0..9].
Interestingly, my situation is exactly like this. I think
this is where I've gotten to.
http://moonpatio.com/fastcgi/hpaste.fcgi/view?id=5120#a5120
strangely enough Ive gotten no speedup at all from the substitution cost
UArray (though I had to make it Int, Int to deal with digits.). But still I
wonder if there's something else I missed. Im really
On Fri, 2009-11-27 at 11:07 +0100, Sebastian Fischer wrote:
We cannot write
class Name a where ...
instance Name Name where ...
Yes! Very annoying.
I want to be able to make a type that is the most general instance of a
single-parameter type class. This is a useful OOish thing
Hello folks,
I took advantage of Thanksgiving weekend to port my application to use
Control.Monad.Failure, and learned (slightly painfully) that I still
needed to pick some mechanism to instantiate my failure monads as.
After the experience, I have three questions/comments:
1. Why isn't there an
It sounds as if you want to carry some state around for each partially
applied function, I think that's in monad territory.
A cardinal rule of functional programming is to create new data,
whenever possible.
--
Regards,
Casey
___
Haskell-Cafe mailing
You can pattern match on the right hand side of '|' in a list
comprehension, since a list comprehension is just the list monad.
add :: Int - Int - Int
add x y = x + y
-- a list of partially applied functions
adds = [add 3, add 5, add 7, add 3, add 5, add 8]
-- an example usage of the list
kP
Hi Ryan,
first, to get this out of the way, you wrote:
Also, your definition of Function seems to have problems with
scoping; unless you intended to make a dynamically scoped language,
No, absolutely not! In fact, the whole exercise has been born out of
frustration with certain ad-hoc
Does anyone know why types and values are in separate namespaces but
classes and types are not?
I think it's because you cannot currently distinguish them in module
import/exports.
Ah, good point. For constructors there is special syntax which allows
to distinguish them in im/exports. Even
Just tried to use Hoogle and got: 500 Internal Server Error
Michael
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
vishnu wrote:
I always thought lazyness was automatic and
seq made strictness possible.
Laziness is the default, but that doesn't mean it's everywhere. For
example, every time you do pattern matching you enforce strictness:
foo (x:xs) = 5
==
foo _|_ == _|_
However, there's also
Hello,
I'm having trouble setting breakpoints from ghci. I load the files
and I can tell things are working correctly because I can run the
program and list the locations where I want to set breakpoints. E.g.
Prelude :list Focus.focus
510 focus :: forall s m. Class s m = Neg - m [Foci]
511
vishnu wrote:
wow ok, I'm not even able to see why they're different in the desugared
version
They're different because case is strict binding (see caveat below)
whereas let is lazy binding. If we say,
let foo = big ugly computation in bar
Then if foo isn't used in bar, it'll never be
On Sat, 28 Nov 2009 23:18:00 -0500
Matt == Matt Arsenault arse...@rpi.edu wrote:
Hi Matt,
Matt This is a very early announcement for an initial release of
Matt bindings for Clutter 1.0, now on
Matt Hackage,http://hackage.haskell.org/package/clutterhs
Thanks a lot for this project. I'm just
37 matches
Mail list logo
