>
> The tarball was missing its Rules.hs; as it happens, GHC has a module
> named Rules.hs as well, hence the confusing error. I've uploaded a
> fresh one that should work.
Thanks. This builds and installs fine.
But I think there is something wrong with the generated parser. It
doesn't look for
On 11 May 2010 00:16, Henning Thielemann wrote:
>
> On Tue, 11 May 2010, Ivan Lazar Miljenovic wrote:
>
>> Henning Thielemann writes:
>>
>>> I do not see why there is the need for any type extension, at
>>> all. Consider cabal-sort, a very basic program, that is Haskell-98
>>> today, will no long
On 11 May 2010 00:22, Henning Thielemann wrote:
>
> On Tue, 11 May 2010, Ivan Miljenovic wrote:
>
>> You're splitting apart related data into _three_ different data
>> structures (the graph, vertex labels and edge labels)? _That_ doesn't
>> make sense.
>
> There are no edge labels, only vertex la
On Mon, May 10, 2010 at 4:50 PM, Tom Hawkins wrote:
>> In fact, if you just want
>> Read-like functionality for a set of Haskell datatypes, use polyparse: the
>> DrIFT tool can derive polyparse's Text.Parse class (the equivalent of Read)
>> for you, so you do not even need to write the parser your
> In fact, if you just want
> Read-like functionality for a set of Haskell datatypes, use polyparse: the
> DrIFT tool can derive polyparse's Text.Parse class (the equivalent of Read)
> for you, so you do not even need to write the parser yourself!
Cabal install DrIFT-cabalized complains. What is
I updated happstack-hamlet 0.2.1. Just had to update the example, and
bump the version bounds.
- jeremy
On May 8, 2010, at 5:29 PM, Michael Snoyman wrote:
Hi all,
I'm happy to announce the second major release of Hamlet[1]. Hamlet
is a HTML templating library which works via quasi-quoting
We are looking to hire a Haskell expert to work with us at Well-Typed as
a Haskell consultant. We are seeing an increasing demand for our
services, and are thus seeking to expand our capacity.
This is an exciting opportunity for someone who is passionate about
Haskell and who is keen to improve a
On Tue, May 4, 2010 at 12:18 PM, HASHIMOTO, Yusaku wrote:
> This library is inspired by HList[2], and interfaces are stealed from
> data-accessors[3]. And lenses[4], fclabels[5], and records[6] devote
> themselves to similar purposes.
>
> [2]: http://hackage.haskell.org/package/HList
> [3]: http:/
Makes sense. From what you wrote, it seems like this might be a dead-end and
can't really be optimized away. Do you agree?
Max
On May 10, 2010, at 8:38 PM, Jan-Willem Maessen wrote:
>
>
> On Mon, May 10, 2010 at 5:38 AM, Max Cantor wrote:
> Based on some discussions in #haskell, it seemed
On Tue, 11 May 2010, Ivan Lazar Miljenovic wrote:
Henning Thielemann writes:
I do not see why there is the need for any type extension, at
all. Consider cabal-sort, a very basic program, that is Haskell-98
today, will no longer run in Hugs and JHC (untested so far) because it
uses FGL's topo
Thanks, Chris and Bartek. It was quite a read. I finally
arrived at an implementation as follows.
--8<---cut here---start->8---
{-# LANGUAGE MultiParamTypeClasses
, FunctionalDependencies
, FlexibleInstances
, UndecidableInstan
On Tue, 11 May 2010, Ivan Miljenovic wrote:
You're splitting apart related data into _three_ different data
structures (the graph, vertex labels and edge labels)? _That_ doesn't
make sense.
There are no edge labels, only vertex labels. And yes, I find separation
of data structures for separ
On 11 May 2010 00:08, Henning Thielemann wrote:
> Because looking up the Map is already very convenient. Why shall I go via
> the graph? In the Make example, the graph represents relations between
> files. It is not important what particular shell commands must be run for
> generating one file fro
Henning Thielemann writes:
> On Mon, 10 May 2010, Ivan Lazar Miljenovic wrote:
>
>> As I said, we're considering using an Associated Type to let users
>> choose what type they want to use (probably with a default Map instance
>> for this). However, we'd recommend/push the Int-based one.
>
> I do
On Tue, 11 May 2010, Ivan Lazar Miljenovic wrote:
Henning Thielemann writes:
That is, in principle you could also use an unlabelled graph with
FilePath as node type and you could manage a (Map FilePath (IO ()))
yourselve and FGL does even not know about its existence.
Yes, but why? That's
Henning Thielemann writes:
> On Mon, 10 May 2010, Heinrich Apfelmus wrote:
>
>> The nodes are file paths, labeled with a corresponding IO action to
>> create the file. The nodes are created from a list of rules that specify
>> how to create an output file from several input files.
>
> That is, in
On Mon, 10 May 2010, Ivan Lazar Miljenovic wrote:
As I said, we're considering using an Associated Type to let users
choose what type they want to use (probably with a default Map instance
for this). However, we'd recommend/push the Int-based one.
I do not see why there is the need for any t
On Mon, 10 May 2010, Heinrich Apfelmus wrote:
The nodes are file paths, labeled with a corresponding IO action to
create the file. The nodes are created from a list of rules that specify
how to create an output file from several input files.
That is, in principle you could also use an unlabel
Heinrich Apfelmus writes:
> I'm not sure what the right solution is, but I think it definitely
> involves catering for different node types. For instance, the library
> could operate on a type
>
> newtype Graph node a b = Graph (Gr a b, Data.Map.Map Int node)
>
> or it could offer a more usefu
Thank you Daniel and Ivan, with firefox i finded out that my text file
was encoded in WINDOWS-1252.
So a commande line such as:
iconv -f WINDOWS-1252 -t ISO-8859-1 liste.txt > liste2.txt
did the trick.
Alternatively, i modified my code with:
myReadFile a = do
h <- openFile a ReadMode
Ivan Lazar Miljenovic wrote:
> Henning Thielemann writes:
>
>> Recently I wrote cabal-sort using FGL
>> http://hackage.haskell.org/package/cabal-sort
>>
>> It sorts cabal packages topologically according to their
>> dependencies. However, I was neither happy with the way FGL currently
>> works, n
Henning Thielemann writes:
> Ivan Lazar Miljenovic schrieb:
>
>> Pros for allowing you to use a custom node type:
>> * Matches your data better
>> * No need for extra lookup maps when converting your data to FGL form
>>
>> Cons:
>> * Makes type-sigs uglier/more verbose
>
> Unlabelled graphs with
There is the ChristmasTree package
(http://hackage.haskell.org/package/ChristmasTree) which provides a very fast
read alternative by deriving grammars for each datatype. If you want to know
the speed differences, see http://www.cs.uu.nl/wiki/bin/view/Center/TTTAS for
more information (it's in t
Maybe this is what you are looking for:
http://www.haskell.org/haskellwiki/Idiom_brackets
-chris
On 9 mei 2010, at 18:39, Xiao-Yong Jin wrote:
> Hi,
>
> Is it possible to have a function accept variable number of
> arguments, such that 'f' can be instantiated to different
> concrete types as
>
Ivan Lazar Miljenovic schrieb:
> Pros for allowing you to use a custom node type:
> * Matches your data better
> * No need for extra lookup maps when converting your data to FGL form
>
> Cons:
> * Makes type-sigs uglier/more verbose
Unlabelled graphs with custom node type would have only one typ
On Mon, May 10, 2010 at 5:38 AM, Max Cantor wrote:
> Based on some discussions in #haskell, it seemed to be a consensus that
> using a modified continuation monad for Error handling instead of Eithers
> would be a significant optimization since it would eliminate a lot of
> conditional branching
Henning Thielemann writes:
> On Wed, 28 Apr 2010, Ivan Miljenovic wrote:
>
>> So you don't want the labels to be part of the actual datatype? And
>> for users to then have to deal with any labels they want themselves?
>
> Recently I wrote cabal-sort using FGL
> http://hackage.haskell.org/packa
On Fri, 7 May 2010 08:42:31 -0700, Jason Dagit wrote:
> On Fri, May 7, 2010 at 2:29 AM, Nicolas Pouillard <
> nicolas.pouill...@gmail.com> wrote:
>
> > On Thu, 06 May 2010 01:08:08 +0200, Günther Schmidt
> > wrote:
> > > Hello,
> > >
> > > I'm switching from darcs to mercurial with some of my pr
On Wed, 28 Apr 2010, Ivan Miljenovic wrote:
So you don't want the labels to be part of the actual datatype? And
for users to then have to deal with any labels they want themselves?
Recently I wrote cabal-sort using FGL
http://hackage.haskell.org/package/cabal-sort
It sorts cabal packages
On May 10, 2010, at 05:51 , Milind Patil wrote:
There seems to something special about (>>=) apart from its type.
And whats
(Monad ((->) b))? I am new to Haskell and I may have gaps in my
understanding of
type inference in Haskell.
Everyone else having answered the first question, I'll tak
On May 10, 2010, at 04:32 , Paul R wrote:
Stephen> If you want to parse a stream, you don't want Parsec as
Stephen> produces as it isn't an online parser - online meaning
Thank you for this well detailed explanation. It was just me misusing
the word "stream", I was actually meaning a simple boun
David Menendez zednenem.com> writes:
>
> It's because >>= is a binary operator. When you partially apply a
> binary operator, you get a "section" which applies one of the two
> arguments.
>
Understood :-)! Thanks for the responses -- both of them.
Milind Patil
___
Really?
There are only 4 fundamental functions in Reactive?
Seems simpler than I thought...
Thanks, btw, I've been looking quite a long time to simple reactive tutos.
2010/5/10 Tom Poliquin
>
> On Monday 10 May 2010 00:08, Jean-Marie Gaillourdet wrote:
>
> >> We have created are a set of demos
On Mon, May 10, 2010 at 5:51 AM, Milind Patil wrote:
> For a function
>
> f :: a -> m b
> f = undefined
>
> I am having trouble understanding how the type of
>
> (>>= f)
>
> is
>
> (>>= f) :: m a -> m b
>
> where, by definition, type of (>>=) is
>
> (>>=) :: (Monad m) => m a -> (a -> m b) -> m b
(>>= f) is equivalent to (flip (>>=) f), not to ((>>=) f). You can try this
with your own function this way:
(&$^) :: (Monad m) => m a -> (a -> m b) -> m b
(&$^) = undefined
:t (&$^ f)
Milind Patil wrote:
For a function
f :: a -> m b
f = undefined
I am having trouble understanding how the
For a function
f :: a -> m b
f = undefined
I am having trouble understanding how the type of
(>>= f)
is
(>>= f) :: m a -> m b
where, by definition, type of (>>=) is
(>>=) :: (Monad m) => m a -> (a -> m b) -> m b
I do not see how (>>= f) even unifies.
I mean if I code a function with th
On 10 May 2010 09:32, Paul R wrote:
[SNIP]
>
> Indeed the doc for 2.0 is really comprehensive, but didn't the library
> evolve a lot between release 2.0 and 3.1 ?
Hi Paul
I think the internals evolved a lot more than the interface - so it
can handle parsing byte-strings etc. There was quite a l
Based on some discussions in #haskell, it seemed to be a consensus that using a
modified continuation monad for Error handling instead of Eithers would be a
significant optimization since it would eliminate a lot of conditional
branching (everytime >>= is called in the Either monad, there is a c
I have reinstall ghc, xmonad and xmonad-contrib but it still doesnot work!
%ghc-pkg list|grep xmonad
xmonad-0.9.1
xmonad-contrib-0.9.1
%cat
/usr/lib/ghc-6.12.1/package.conf.d/xmonad-contrib-0.9.1-e073c906e3b29eb062e632e9bb989664.conf|grep
LayoutHints
XMonad.Layout.Layou
Hello Stephen,
Stephen> The 10 year old documentation is very good though - for my
Stephen> taste, Parsec 2.0 is the best documented Haskell lib I've seen.
Indeed the doc for 2.0 is really comprehensive, but didn't the library
evolve a lot between release 2.0 and 3.1 ?
Stephen> If you want to pa
On Monday 10 May 2010 00:08, Jean-Marie Gaillourdet wrote:
>> We have created are a set of demos and tutorials for
>> FRP ("Conal reactive"). It consists of four demos: the simple furnace,
>> the human controlled furnace, the hybrid robot sim, and the FRP robot sim.
> since I never took the
Hi,
since I never took the time to understand frp properly I thought it would be
helpful to look at some examples. I was able to compile and run the first to
programs after I managed to find out the dependencies. But I failed to compile
third one. I just got the a compiler error with ghc-6.12.1
zaxis writes:
> It seems that it is not a xmonad problem as xmond just call ghc
> directly.
Well, yes, except that it might be something else to do with your
config, etc. and as such the xmonad mailing list is probably more
relevant.
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMilje
43 matches
Mail list logo
