John D. Ramsdell ramsde...@gmail.com writes:
In absence of any explicit limits, I think a sensible default is to set
maximum total memory use to something like 80%-90% of physical RAM.
This would be a poor choice on Linux systems. As I've argued
previously in this thread, the best choice is
There is also Nix (http://nixos.org/) which is based on somewhat related ideas.
On Fri, Dec 17, 2010 at 8:32 AM, Max Bolingbroke
batterseapo...@hotmail.com wrote:
On 17 December 2010 00:59, Gregg Reynolds d...@mobileink.com wrote:
My real goal is to think about better
language for software
Eugene Kirpichov schrieb:
Hi cafe,
I've published a large presentation about two Haskell-based tools of
mine - tplot and splot.
Their motto is visualize system behavior from logs with a shell one-liner.
Based on my experience, they usually seem to live up to this motto.
Mathijs Kwik bluescreen...@gmail.com writes:
It's indeed hard to really explain what I feel is missing.
I think the basics are well covered, with lots of introductory and
tutorial material available. The advanced stuff is very abstract and
general, and the difficult part is developing an
I've recently been playing with code for versioning data types. It's
based on happstacks implementation, but uses type families to make it
more modular. I've got some proof of concept code on github [1]. We're
also writing a small library based on this at typLAB, which we'll
probably release as
Thanks for your answers. I am a little bit surprised, I thought
timestamps were on the milliseconds scale.
@Krzysztof: Yes, you are right, an event-based interface is far
superior to the basic polling approach I took. At present, a couple
seconds granularity is fine with my use case so I don't
On 12/17/10 01:32, Max Bolingbroke wrote:
[snip]
I can't speak for your monad based approach, but you may be interested
in Neil Mitchell's Haskell DSL for build systems, called Shake:
http://community.haskell.org/~ndm/downloads/slides-shake_a_better_make-01_oct_2010.pdf
WARNING: I clicked on
Hi,
What are some interesting, idiomatic ways of writing something similar
to the following, using
a) Only standard utilities
b) Non-standard utilities
getValidatedInteger = do
maybeInt - maybeGet
case maybeInt of
Just int - return int
Nothing - do putStrLn That doesn't seem
On 17 December 2010 13:59, Jacek Generowicz jacek.generow...@cern.chwrote:
What are some interesting, idiomatic ways of writing something similar to
the following
λ :m + Safe
λ let getValidatedInteger = getLine = maybe (do putStrLn That doesn't
seem to be an integer. Try again.;
Hello.
For a couple of friends of mine, hackage.haskell.org happens to
resolve to something strange (parked domain), though haskell.org works
ok. This might be something to tell to haskell.org admins.
Find below an example tracert (messages in Russian have been translated).
C:\Program Files
I don't understand this error message. Haskell appears not to understand that 1
is a Num.
Prelude :t 1
1 :: (Num t) = t
Prelude :t [1,2,3,4,5]
[1,2,3,4,5] :: (Num t) = [t]
Prelude
Michael
===
f :: [Int] - IO [Int]
f lst = do return lst
main = do let lst = f [1,2,3,4,5]
On Fri, Dec 17, 2010 at 09:04:20AM -0800, michael rice wrote:
I don't understand this error message. Haskell appears not to understand that
1 is a Num.
Prelude :t 1
1 :: (Num t) = t
Prelude :t [1,2,3,4,5]
[1,2,3,4,5] :: (Num t) = [t]
Prelude
Michael
===
f ::
On 17 Dec 2010, at 20:04, michael rice wrote:
I don't understand this error message. Haskell appears not to understand that
1 is a Num.
As it clearly states in the error message, it doesn't understand that [Int] is
a Num - and it's not.
No instance for Num something usually indicates that
Hi, all.
Plenty of answers. Thank you.
Putting the list in the IO monad was deliberate. Another one I was looking at
was
f :: String - IO String
f s = do return s
main = do ios - f hello
fmap tail ios
which worked fine
So, the big error was trying to add 1 + [1,2,3,4,5].
I
# Imagine an activity which may be performed either by a computer, or
# by a human (alternatively, either locally, or remotely across a
# network). From Haskell's type system's perspective, these two will
# look completely different (most obviously, the human (or the
# network) is wrapped in IO).
Paul Graham refers to all those features as orthogonality (On Lisp, pg. 63)
and you're right, Haskell has it in spades, but it takes time to understand all
of it and even more time to use it effectively. One almost needs a checklist.
But I think I'm catching on. I programmed this craps
On Friday 17 December 2010 18:04:20, michael rice wrote:
I don't understand this error message. Haskell appears not to understand
that 1 is a Num.
Prelude :t 1
1 :: (Num t) = t
Prelude :t [1,2,3,4,5]
[1,2,3,4,5] :: (Num t) = [t]
Prelude
Michael
===
f :: [Int] - IO
On Friday 17 December 2010 13:45:38, Larry Evans wrote:
WARNING: I clicked on that link in my thunderbird news reader
and got a page which was something about registering domains.
It was nothing about Neil's slides.
I then tried directing my Firfox browser to:
Hi all,
I'm a Chinese haskeller, i'm looking for haskell job at *China*.
Please contact me if any Chinese company interested me.
Below is my skills:
* Java : (2007-06 ~ 2008-09)
Worked on a variety of commercial J2ME games, masterpiece Machine
King : http://goo.gl/lcJF
*
19 matches
Mail list logo
