then "It's a joke"
>>else "It's real"
>
> My strategy next year will be to not read any email on the 1st. I'll
> just wait until the 2nd to read it all. Foolproof!
Hmm, nope, still failed. I was following along until it got
cmd=render_article&write=rl
This is all rather hacky as well, and none of it has been tested so it might
not actually work, although I see no reason why it shouldn't. It's also
fragile, as if wikipedia changes just about anything it could all brake, but
that's the risk you run anyt
horses of
functional programming, are simply too foreign to most peoples imperative
way of approaching problems.
-R. Kyle Murphy
--
Curiosity was framed, Ignorance killed the cat.
On Wed, May 5, 2010 at 16:29, Limestraël wrote:
> Yes, the xmonad approach is very neat, but I see 2 major (IMO) draw
was
smart enough to inherit contracts from functions used and display these
derived contracts this would be a very simple way to find all the edge cases
of your code.
-R. Kyle Murphy
--
Curiosity was framed, Ignorance killed the cat.
On Tue, May 4, 2010 at 12:56, John Lato wrote:
> On Tue, M
printDoor (zip [0..(n-1)] doors)
{- The main entry point to the program, calls printUpTo with 100 -}
main :: IO ()
main = printUpTo 100
--- End Code ---
-R. Kyle Murphy
--
Curiosity was framed, Ignorance killed the cat.
On Mon, May 3, 2010 at 13:15, Samuel Williams <
space.ship.travel...@
That's also the approach Yi uses. I'm fairly certain there's a library on
hackage that makes writing up programs in that style fairly trivial,
although I can't remember the details right now. I'd look up Yi as a
starting point.
-R. Kyle Murphy
--
Curiosity was framed,
the instance of wrong code that compiles would be
higher. The only argument to support non-strict typing would be if you could
show that it takes less time to track down runtime bugs than it does to fix
compile time type errors, and any such claim I'd be highly skeptical of.
-R. Kyle Murphy
--
first time through, or the result of the last run,
and passes them both to pass. -}
run :: Int -> [Door]
run n = foldl (flip pass) (replicate n *Closed*) [0..n]
main = print $ run 100
--- End Code ---
-R. Kyle Murphy
--
Curiosity was framed, Ignorance killed the cat.
On Mon, May 3, 2010
in a similar
direction. At the very least those of us not in both the web-devel and
haskell-cafe mailing lists might want to check the other one out.
-R. Kyle Murphy
--
Curiosity was framed, Ignorance killed the cat.
On Fri, Apr 9, 2010 at 14:12, Evan Laforge wrote:
> > 3) Configuratio
didn't realize you could initialize a socket using the Network.Socket
functions and just pass that instead. The example in your latest mail is
much clearer.
-R. Kyle Murphy
--
Curiosity was framed, Ignorance killed the cat.
On Thu, Mar 11, 2010 at 09:35, Martin Kiefel wrote:
> On Thu
nless
accessed through the proxy). I don't know enough about happstack to answer
his question, but I can see from the documentation you provided that there
doesn't seem to be any way to specify address to bind to as Dmitry stated in
his original e-mail.
-R. Kyle Murphy
--
Curiosity was fr
s4 = show (silver s g)
in Just (s1 ++ s2 ++ s3 ++ s4)
else Just "Bad Guess"
-R. Kyle Murphy
--
Curiosity was framed, Ignorance killed the cat.
On Tue, Mar 9, 2010 at 17:42, Brent Yorgey wrote:
> On Tue, Mar 09, 2010 at 08:42:44PM +0100, Sebastian Hungerecker wrote:
&
of the browser, but of course you couldn't rely
on something like that being available on any browser except your own.
-R. Kyle Murphy
--
Curiosity was framed, Ignorance killed the cat.
On Mon, Oct 26, 2009 at 03:22, Mathijs Kwik wrote:
> There used to be http://www.haskell.org/haskellwiki/
I likewise agree this isn't a job for Hoogle, but on a related note see my
previous post in here about needing better documentation (specifically a
proper manual for most hackage pages, not just a bare bones API doc):
http://www.haskell.org/pipermail/haskell-cafe/2009-October/067969.html
-R.
nt] to [(Int, Int)]) you can use map
or zip like so:
> map (\x -> (x,x)) [1,2,3] -- applies a function to each member, in this
case the lambda \x -> (x,x) which just makes a tuple
> zip [1,2,3] [1,2,3] -- combines two lists into one by making each element
of the joined list a tuple of one
ype, which is why when you try
to store [1,2,3] in the IORef you get back [(),(),()]. Try this instead and
it should work:
> let aaa = unsafePerformIO $ newIORef ([] :: [Int])
-R. Kyle Murphy
--
Curiosity was framed, Ignorance killed the cat.
On Thu, Oct 22, 2009 at 01:02, zaxis wrote
ks to good user manual and tutorial):
http://hackage.haskell.org/package/DeepArrow
Bad API docs (but once again with a link to average manual/tutorial):
http://hackage.haskell.org/package/actor
-R. Kyle Murphy
--
Curiosity was framed, Ignorance killed the cat.
On Mon, Oct 12, 2009 at 16:29, John L
17 matches
Mail list logo
