On 9/26/07, Graham Hutton [EMAIL PROTECTED] wrote:
Salary will be within the range 25,134 - 32,796 pounds per year,
depending on qualifications and experience. The post is available
immediately, and will be offered on a fixed-term contract for 3 years.
I don't mean to diminish the
On 8/17/07, rodrigo.bonifacio [EMAIL PROTECTED] wrote:
Hi all.
I want to create the following polymorphic type (EnvItem) that we can apply
two functions (envKey and envValue). I tried the following:
type Key = String
data EnvItem a = EnvItem (Key, a)
envKey :: EnvItem (Key, a) -
On 8/3/07, Lewis-Sandy, Darrell [EMAIL PROTECTED] wrote:
Is there a class property of the Control.Arrow class that represents the
evaluatation of an arrow:
eval :: (Arrow a)=a b c-b-c
You could always use the ArrowEval class. Granted, it doesn't exist,
so you'd have to write it, but it
On 7/18/07, Martin Coxall [EMAIL PROTECTED] wrote:
On 7/18/07, Jon Harrop [EMAIL PROTECTED] wrote:
On Tuesday 17 July 2007 23:26:08 Hugh Perkins wrote:
Am I the only person who finds it interesting/worrying that there are few
to no people in the group who are ex-C# programmers. I mean, you
On 7/16/07, Niko Korhonen [EMAIL PROTECTED] wrote:
I'm writing some code to generate a dither (=noise) signal. I'm trying
to generate an infinite series of noise with triangular distribution but
my code hangs into an infinite loop. The problem is that I'm not very
good with Haskell IO yet and I
also hope it is correct!)
And I do not really know how to fix it, maybe somebody else can write
about that.
Bryan Burgers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 6/18/07, Pasqualino 'Titto' Assini [EMAIL PROTECTED] wrote:
Having just presented a case for the possible rationality of the irrational
decision of creating an Emacs-like IDE in Haskell, I wonder if we should not
be even more irrational and contemplate the possibility of using Haskell to
is its funding will be reliable? for example, if we don't get money
from Google in 2008 year?
in irc some time ago i brought up the topic of something like the
freebsd or wikimedia foundations, but for haskell. if you can give me
a secure and trustworthy method of payment, and as a bonus, a
library for people
to start patching?
Bryan Burgers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 3/31/07, Scott Brown [EMAIL PROTECTED] wrote:
It's working now, thank you.
I changed the definition to
binom n j = div (fac n) ((fac j)*(fac (n - j)))
bernoulli n p j = fromIntegral(binom n j)*(p ^ j) * ((1 - p)^(n - j))
As a matter of style suggestion, it might make 'binom' more clear
My idea is to have a monad with a concatenating , so that I can:
bulidStuff = do
func1
func2
func3
func4
Leandro Penz
I actually did this recently for a project I have been working on.
First, an example:
output label a@(I.Add a1 a2 a3) = do
comment (show a)
mov' label eax a1
On the topic of 'fix', is there any good tutorial for fix? I searched
google, but mostly came up with pages including things like 'bug fix'.
It's hard for me to get an intuition about it when 'fix' always stack
overflows on me because I don't really know how to use it.
On 3/6/07, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
Does the following code increase the level of recursion
once for each input line or is the recursive construct
converted to an iteration?
Thanks,
Dave Feustel
main :: IO ()
main = do
line - getLine
processIt line
main
processIt ::
Haskellers,
Recently, I have come across a couple of situations in which I need to
pull a monad out of a functor so to speak. The first time it was
needed, I didn't think much of it, but the second time started me
thinking whether there is already an existing construct for this. The
type
http://haskell.org/ghc/dist/current/docs/libraries/base/Data-Traversable.html
pull is sequence, fmapM is mapM (also see the sequenceA, traverse
functions for the more general case of applicative functors vs. monads)
Stefan
Ah yes, thank you! Saying It seems to me that if this were a class,
tips.
--
Tony Morris
You may be able to glean some ideas from a previous discussion at:
http://comments.gmane.org/gmane.comp.lang.haskell.cafe/19623
Bryan Burgers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
? If
this is not the place to ask, where should I be asking?
Bryan Burgers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ScopeState Bool
So, my new question is: Why does it matter how ScopeState is defined?
Bryan Burgers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I am not sure how to express f1 with map? how do I say
(lambda (ls)
(map (lambda (x) (list x))
ls))
in Haskell? map ([]) ?
map (:[]), :[] takes a single element and puts it into a list. Some
people refer to this as box
Another way to express f1 with map is:
f1 xs = map (\x -
to be the
same type as the first, so use 'b' instead of 'a'.
always first = (\_ - first) -- replace 'second' with '_', because
we don't need to bind anything to the second parameter.
Does that makes sense?
Bryan Burgers
___
Haskell-Cafe mailing list
Haskell
On 12/20/06, Jason Dagit [EMAIL PROTECTED] wrote:
Am I the only one that doesn't get it?
Jason
No, you are not the only one that doesn't get it.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
with last
summer. Haskell is good for a lot of things, and I'm sure somebody
someday will show me that Haskell is even great for GUI/Database, but
you should always use the right tool for the job, and for your job,
I'd say C# is the right tool.
Bryan Burgers
pairs
mapM_ (uncurry renameFile) pairs
==
mapM_ (\p - putDirs p) pairs
mapM_ (\p - uncurry renameFile p) pairs
==
mapM_ (\p - putDirs p uncurry renameFile p) pairs
Is that a reasonable solution?
Bryan Burgers
___
Haskell-Cafe mailing list
Hang on, hang on, now I'm getting confused.
First you asked for the smallest (positive) x such that
1+x /= x
which is around x=4.5e15.
1 + 0 /= 0
0 is smaller than 4.5e15
So I don't understand this at all...
But then 0 isn't positive.
Why not?
In any case every positive number
this, it seems that having to keep track of all of this
might get a bit unruly.
Bryan Burgers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Classes where Types go would just serve to muddle that
understanding.
Bryan Burgers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
advantage of partial
application, so why did you define 'foreach' and then use it instead
of using 'mapM_'? I am just curious, and have always been interested
in reasons behind coding style.
Bryan Burgers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 6/15/06, Vladimir Portnykh [EMAIL PROTECTED] wrote:
Suppose there is a data definition in Haskell:
data MyType = MyType { date :: Double,
weight :: Double,
height:: Double
} deriving (Eq, Ord, Show)
Is it possible to
Vladimir,
I think you forgot to put Haskell-cafe as a recipient of this email,
so first I'll repost what you wrote.
On 6/15/06, Vladimir Portnykh [EMAIL PROTECTED] wrote:
many thanks. i have the follwoing code:
module MyType (DataContainer(..)) where
import Maybe
data DataContainer =
On 6/13/06, Jenny678 [EMAIL PROTECTED] wrote:
Hallo
I search a code for
elements_in_List([1,2],[1,2]).
True
elements_in_List([1,8],[1,2,3,4,8]).
True
elements_in_List([2,1],[1,2]).
True
elements_in_List([1,1],[1]).
False
I have a code
elements_in_List :: Eq a = [a] - [a] - Bool
Recently, I have seen a few messages to Haskell Cafe (Like Marc
Weber's Is there any url lib? and Ferenc Wagner's LDIF output
library, as well as many replies like oh, you can find that library
at this link...) that have prodded me to ask what I've been wondering
for a long time.
What are the
31 matches
Mail list logo
