I think the haddock description field is a great barrior to documentation. I
don't want to clutter my cabal file with lengthy documentation.
Michael Snoyberg and I could not figure out how to document the Hamlet
syntax because there is no way (as far as I know) to have literal
unescaped, uninterpre
On 24.07.2011 08:20, Ivan Lazar Miljenovic wrote:
> On 24 July 2011 04:41, KC wrote:
>> It would be easier for beginners to "grok".
I quite like mempty/mappend; they (f)map onto the [] instance as a mnemonic.
Similarly, MonadPlus (as a concept) maps to mzero/mplus quite well (and
it's distinguis
I'm pleased to announce the 1.0 release of shelltestrunner!
Home page: http://joyful.com/repos/shelltestrunner
Install: $ cabal install shelltestrunner
shelltestrunner tests command-line programs or arbitrary shell
commands. It reads simple declarative tests specifying a command,
some input, an
I'm using it as the basis for a lightweight distributed generalised MapReduce
framework for Haskell, which basically turns out to be a framework for
distributed monads. I haven't started serious work yet, but expect to in the
next few days, and so would be interested to share experiences.
J
On 24 July 2011 00:49, Sebastien Zany wrote:
> Would it be theoretically possible/convenient to be able to put boilerplate
> like this in class definitions?
Not really: what happens for Functors that aren't Monads? Also, for
some Monads there may be a more efficient definition of fmap than
using
On 24 July 2011 04:41, KC wrote:
> It would be easier for beginners to "grok".
I don't think so... but while we're at it, what's with that weird name
"Monoid" anyway, let alone "Functor", "Monad", etc.? ;-)
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.wordpress.com
___
On 7/23/11 1:31 AM,
Александр wrote:
> Hello,
>
> I built binary tree with:
>
> data Tree a = Empty
>| Node a (Tree a) (Tree a)
>deriving (Eq, Ord, Read, Show)
>
> How can i make Monad type class instance for this tree? And can i make
it on not?
Of course you can. O
On 7/23/11 9:37 AM, Ting Lei wrote:
>
> I know the Reverse Polish is not a couple of hundred years old.
> I have an impression of reading something about people writing natural
> deduction systems using only dots in place of parenthesis. And it is
> said that it was "natural" in those pre-historic
On Sat, Jul 23, 2011 at 8:51 PM, Yves Parès wrote:
> Hello Café,
>
> Where do you people stand on using OpenGLRaw instead of the higher-level
> layer?
> I saw that the ports of the nehe tutorial use directly OpenGLRaw, and I
> wondered why that choice had been made.
>
> __
I'm a bit curious about who might be using GPipe.
I've been trying to find a good variation on OpenGL that integrates nicely
with reactive programming. Issues such as texture management seem to be
rather difficult targets.
On Sat, Jul 23, 2011 at 12:06 PM, Jake McArthur wrote:
> Translation from
Translation from c is much more straightforward with openglraw compared with
OpenGL. Also, many of the design decisions behind OpenGL are arbitrary or
limiting, and some features aren't even exposed in its interface.
___
Haskell-Cafe mailing list
Haskell-
Hello Café,
Where do you people stand on using OpenGLRaw instead of the higher-level
layer?
I saw that the ports of the nehe tutorial use directly OpenGLRaw, and I
wondered why that choice had been made.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell
I have spent several months studying use of generative grammars in
multi-agent reactive systems [1] - granted, not FRP in particular, but RDP
is reasonably close [2]. This result is, implicitly, a distributed,
federated machine-learning system (briefly described at [3]). The 'learning'
supports rap
It would be easier for beginners to "grok".
--
--
Regards,
KC
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I highly recommend that you check out #haskell on freenode. In my opinion
its the best channel on freenode, and there are always tons of helpful
people and a lot of stimulating conversation. Hope to see you there!
___
Haskell-Cafe mailing list
Haskell-Caf
Hi everybody -
I'm just starting to learn Haskell, and I figured it would be productive to
first review my Lambda-Calculus that I picked up in college. Actually, we
only touched upon it in college, so I'm effective learning it all over again
for the first time. Anyway, I'm working my way through
As far as I am aware, there has been very little work on combining
these two, but that does not mean that it is a bad idea. I can give
you some pointers from a very personal perspective:
-Machine learning is mostly kernel methods and probabilistic
inference, I can't really say much about how one w
> 2) One possibility is just have it being (Node x _ _) >>= f = f x
>
It does not follow monad laws (right identity to be more precise):
(Node 1 (Node 2 Empty Empty) Empty) >>= return ≡
return 1 ≡
Node 1 Empty Empty
≠
(Node 1 (Node 2 Empty Empty) Empty)
Regards
signature.asc
Description: This
Would it be theoretically possible/convenient to be able to put boilerplate
like this in class definitions?
On Thu, Jul 21, 2011 at 5:58 AM, Felipe Almeida Lessa <
felipe.le...@gmail.com> wrote:
> On Thu, Jul 21, 2011 at 8:31 AM, Ivan Lazar Miljenovic
> wrote:
> > Well, for fmap vs liftM, you h
On Sat, 2011-07-23 at 06:37 -0700, Ting Lei wrote:
> I know the Reverse Polish is not a couple of hundred years old.
> I have an impression of reading something about people writing natural
> deduction systems using only dots in place of parenthesis. And it is
> said that it was "natural" in tho
I know the Reverse Polish is not a couple of hundred years old.
I have an impression of reading something about people writing natural
deduction systems using only dots in place of parenthesis. And it is
said that it was "natural" in those pre-historic times.
That's also why I had this (mis-)c
On 23 July 2011 21:33, Joris Putcuyps wrote:
> About your first point, I'm aware of that. It would have been
> nice if .cabal and haddock used markdown, this is very popular, thanks
> to pandoc. Then generating html, pdf, texinfo, ... would be very easy.
This has been suggested before, e.g.
http:
On Sat, 23 Jul 2011 10:47:18 +
Ivan Lazar Miljenovic wrote:
> On 23 July 2011 10:35, Joris Putcuyps
> wrote:
> > Hello everybody
> >
> > I'm looking for a way to avoid having two files with almost the same
> > information on github: README.markdown and package.cabal.
> >
> > As far as I can
Hi Joris,
not exactly what you are think about, but still maybe somewhat related.
I thought it would be nice to have support for literate Haskell in
README files (say README.lhs) on GitHub. I've done something similar
for WAI[1], using sed to transform it to markdown, native support
support for RE
On 23 July 2011 10:35, Joris Putcuyps wrote:
> Hello everybody
>
> I'm looking for a way to avoid having two files with almost the same
> information on github: README.markdown and package.cabal.
>
> As far as I can tell, a new github README parser[1] can be written,
> but it only supports README
Hello everybody
I'm looking for a way to avoid having two files with almost the same
information on github: README.markdown and package.cabal.
As far as I can tell, a new github README parser[1] can be written,
but it only supports README files with different extensions and requires
either ruby o
On Fri, Jul 22, 2011 at 4:11 PM, Tom Murphy wrote:
> Is anyone using Cloud Haskell yet? I'm really excited by the
> possibilities.
Hello there! I'm currently looking at the possibility of incorporating
it into my masters thesis project (A Haskell EDSL for agent-based
simulation), but haven't yet
On Jul 23, 2011, at 7:31 AM, Александр wrote:
> data Tree a = Empty
> | Node a (Tree a) (Tree a)
> deriving (Eq, Ord, Read, Show)
>
> How can i make Monad type class instance for this tree?
Like David said, you'll need a sensible way to merge 2 trees. As we have no
On Wed, 20 Jul 2011 23:36:34 +0400
Sergey Mironov wrote:
> Hi. I was searching for info about building ghc on ARM arch. I already
> know about [1] approach, and also saw debian binaries [2], but I am
> afraid I have to compile ghc by myself this time, since our system
> uses incompatible libc, so
2011/7/22 Александр
> How can i make Monad type class instance for this tree? And can i make it
> on not?
>
You'll apply 'f' to every node in the tree. You'll need some sensible
mechanism to merge the resulting trees.
You might have an easier time for merging a slightly different tree type:
T
2011/7/23 Александр :
> Hello,
>
>>1) Do you really need a Monad instance for this?
>
> Only for training purposes.
Then if you _must_ define Monad instances, maybe you should consider
one for a data structure which makes more sense?
> 2) One possibility is just have it being (Node x _ _) >>= f =
2011/7/23 Александр :
> I built binary tree with:
>
> data Tree a = Empty
> | Node a (Tree a) (Tree a)
> deriving (Eq, Ord, Read, Show)
> How can i make Monad type class instance for this tree? And can i make it on
> not?
If you had a monad for Tree a, then you'd have
Hello,
>1) Do you really need a Monad instance for this?
Only for training purposes.
2) One possibility is just have it being (Node x _ _) >>= f = f x
I've already tried to do so, but i get only 1 element. Look.
I have a function fillTree that's fill this binary tree.
let a = fillTree 1 Empty
33 matches
Mail list logo
