://clemens.endorphin.org/ILC07-Liskell-draft.pdf
Latest news:
http://blog.clemens.endorphin.org/2009/01/liskell-standalone.html
Have fun,
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
, then try again. Often by fixing one error
from the list a sizeable portion of the rest just vanish (I forget the
English term for that kind of error).
(In before you can use sth like quickfix to go through the first few
errors and compile again whenever you feel like it.)
--
Ariel J. Birnbaum
for additional insight.
References: [1] http://www.haskell.org/hoogle/
Have fun!
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
overkill, but good learning material =)
Have fun!
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
either.
NB: In general, there's a weird obstacle I notice when writing Haskell:
the unshakable feeling that whatever I write, there's already a better
name for it and a more elegant implementation lying around. It can get
downright paralyzing at times *shudder*
Have Fun,
--
Ariel J. Birnbaum
On Sat, 2008-11-15 at 16:23 -0700, Luke Palmer wrote:
On Sat, Nov 15, 2008 at 3:59 PM, Ariel J. Birnbaum [EMAIL PROTECTED] wrote:
When working with Applicative, I often find myself defining and using
this operator:
(%) :: (Applicative f) = f (a - b) - a - f b
f % x = f * pure x
Yeah
for another extension? And what after that?.
Note to self: give Liskell a try before the end of the year.
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
area for programing in general, but I think it's
also one where Haskell can shine with an elegant, typesafe model.
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
enabled.
None of these help in making an expression like
(a + b) + c == a + (b + c) :: Bool
any more referentially transparent than
getChar : getChar : [] :: [Char]
would be if it was legal.
Anyway, enough rant for tonight. Sorry for the hijack.
We now resume our regular transmissions.
--
Ariel J
not a case for distribution specific binaries but for assisting
system wide package management.
I personally prefer my hackage packages freshly cooked ...
APT supports source packages as well, and one can build and install from them.
Cook 'em, baste 'em, roast 'em =D
--
Ariel J. Birnbaum
exposure to the packages' source would it imply? My employer is
rather paranoid about its coders being contaminated by third-party code =P.
While I'm asking --- maybe we should target Debian first/also/instead?
Cheers
--
Ariel J. Birnbaum
___
Haskell
packages for
Debian Ubuntu.
However, we do need some Ubuntu champions who can work incrementally,
over a long time, to keep packages up to date on their systems.
Pray tell, what kind of feats are expected of such a champion?
--
Ariel J. Birnbaum
your program (a problem shared by most non-Lisp languages).
While TH provides a fairly decent solution in this respect, it's still far
from Lisp's flexibility. In this respect, does anyone know how the Liskell
project is doing? The site and mailing list seem pretty silent...
--
Ariel J
) % [1..10] :: (MonadRandom m) = m Int
That way you separate the generation from the IO.
My getRandomR(0,3) % cents.
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
it should point to.
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
discussions about style than pitfalls...
it seems to me more oriented to people who know Haskell well and want to
write better.
Maybe a link from here to the above would be a good idea.
Thanks for adding this case to the wiki =)
--
Ariel J. Birnbaum
(such as [x]) for a pattern that iterates
over every element in the list.
I can't seem to find a page with a list of common pitfalls and mistakes...
is there such a thing?
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
the problem is quite trivial =P
Replace
concat . map inits . tails
with
foldr (\x xss - xss ++ map (x:) xss) [[]]
for a correct (yet even more inefficient) solution.
I'd blame the mistake on the late hour, but it was even later when I
noticed... *shame*
--
Ariel J. Birnbaum
/fold
fusion, deforestation and MapReduce. All the cool kids go bananas over it ;)
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
:2:3:[] against x:[]
(:) matched - match 1 against x; 2:3:[] against []
Match 1 against x
x is a variable, bind it to 1
Match 2:3:[] against []
Match failed!
{-# nitty-gritty off #-}
Have fun =)
Jealous 'cause I never had any homework in Haskell,
--
Ariel J. Birnbaum
a - STM a
decT can be of type TVar Int - STM () if you leave out the atomically.
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
For me, the word implies is too tied in my brain to an arrow symbol to
be useful to me in keeping the implications straight.
Pun implied?
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
will of course fail.
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of this class satisfy?
2. How would a pure instance of this class look like (obvious
unsafePerformIO-based solutions aside)? Is it even possible in pure Haskell?
Thanks much!
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
look at http://haskell.org/haskellwiki/Library/ArrayRef for examples
Thanks, Data.Ref.Universal looks just like it!
One question though. In:
class (Monad m) = Ref m r | m-r, r-m where
Why is the second fundep necessary?
--
Ariel J. Birnbaum
This has come up a few times and been written by many Haskellers
I was quite certain of that, hence my puzzlement at being unable to find it =)
What kind of axioms should an instance of this class satisfy?
There are quite a few obvious ones, but I'm not sure it's particularly
necessary.
I'm
be done without compiler support?
--
Ariel J. Birnbaum
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
27 matches
Mail list logo
