On 16 June 2010 16:00, Michael Snoyman wrote:
>
>
> On Wed, Jun 16, 2010 at 8:51 AM, Ivan Miljenovic
> wrote:
>>
>> Next you'll say there's no need for anyone to ask whether they prefer
>> vi or emacs... ;-)
>>
> Of course *real* programmers use ed. It is the standard editor[1].
> Michael
> [1] h
On Wed, Jun 16, 2010 at 8:51 AM, Ivan Miljenovic
wrote:
> On 16 June 2010 15:45, Roman Cheplyaka wrote:
> > * aditya siram [2010-06-15 19:47:37-0400]
> >> Hi all,
> >> Haskell is a great language and in a lot of ways it still hasn't found a
> >> niche, but that's part of what is great about it.
On 16 June 2010 15:45, Roman Cheplyaka wrote:
> * aditya siram [2010-06-15 19:47:37-0400]
>> Hi all,
>> Haskell is a great language and in a lot of ways it still hasn't found a
>> niche, but that's part of what is great about it.
>>
>> But I wanted to ask people are more experienced with Haskell
* aditya siram [2010-06-15 19:47:37-0400]
> Hi all,
> Haskell is a great language and in a lot of ways it still hasn't found a
> niche, but that's part of what is great about it.
>
> But I wanted to ask people are more experienced with Haskell - what kinds of
> problems is it unsuited for? Have y
On Tue, 2010-06-15 at 19:47 -0400, aditya siram wrote:
> Hi all,
> Haskell is a great language and in a lot of ways it still hasn't found
> a niche, but that's part of what is great about it.
>
> But I wanted to ask people are more experienced with Haskell - what
> kinds of problems is it unsuite
Hi Aditya Siram,
- maybe shell scripting: running ghci takes longer than starting bash.
Compiling is not always an option because executables are bigger than
shell scripts or C executables
Haskell could be the wrong choice if
- an existing solution exists which does the job and you know you'
Hi all,
Haskell is a great language and in a lot of ways it still hasn't found a
niche, but that's part of what is great about it.
But I wanted to ask people are more experienced with Haskell - what kinds of
problems is it unsuited for? Have you ever regretted using it for something?
Meaning if yo
Max Cantor writes:
> Its not indonesia, but the Singapore FP Users is pretty close by.
> [snip]
Fine, if we're going to start promoting non-Indonesian Haskell
groups/events, I give you AusHack:
http://www.haskell.org/haskellwiki/AusHac2010
(It was about time for more promotion for this; it's st
Oscar Finnsson writes:
> Hi,
>
> I've just released hs2dot on hackagedb.
>
> It's a small tool that lets you automatically generate graphviz/dot
> code that visualize the relations between data types, types and type
> classes.
This sounds very familiar to my SourceGraph package that's already on
On Tuesday 15 June 2010 23:26:10, Don Stewart wrote:
> deliverable:
> > Wren -- thanks for the clarification! Someone said that Foldable on
> > Trie may not be very efficient -- is that true?
> >
> > I use ByteString as a node type for the graph; these are Twitter user
> > names. Surely it's usef
deliverable:
> Wren -- thanks for the clarification! Someone said that Foldable on
> Trie may not be very efficient -- is that true?
>
> I use ByteString as a node type for the graph; these are Twitter user
> names. Surely it's useful to replace them with Int, which I'll try,
> but Clojure works
Wren -- thanks for the clarification! Someone said that Foldable on
Trie may not be very efficient -- is that true?
I use ByteString as a node type for the graph; these are Twitter user
names. Surely it's useful to replace them with Int, which I'll try,
but Clojure works with Java String fine an
Hi,
I've just released hs2dot on hackagedb.
It's a small tool that lets you automatically generate graphviz/dot
code that visualize the relations between data types, types and type
classes.
Example usage:
> hs2dot Hack.hs | dot -T pdf -o Hack.pdf
Multiple files can be analyzed together as in
On Jun 15, 2010, at 1:42 PM, wren ng thornton wrote:
Generally these sorts of things are called homomorphisms. It's a
terribly general term, but that's the one I've always seen to
describe that pattern.
g is a "list homomorphism", if you want to get specific.
Equivalently, it is the "li
Emmanuel Castro wrote:
I am looking for the name of the property linking two functions f and g
when :
[f(a),f(b),f(c)] = g([a,b,c])
Is there a standard name?
Generally these sorts of things are called homomorphisms. It's a
terribly general term, but that's the one I've always seen to describe
braver wrote:
On Jun 14, 11:40 am, Don Stewart wrote:
Oh, you'll want insertWith'.
You might also consider bytestring-trie for the Graph, and IntMap for
the AdJList ?
Yeah, I saw jsonb using Trie and thought there's a reason for it. But
it's very API-poor compared with Map, e.g. there's not
Sebastian Fischer wrote:
>> Holger Siegel wrote:
>>
>>> orElse :: CMaybe a a -> CMaybe a a -> CMaybe r a
>>> CMaybe ca `orElse` CMaybe cb = CMaybe (\k -> (ca return `mplus` cb
>>> return) >>= k)
>
> I still don't understand why it is impossible to provide `orElse` with
> the original type. I will
On Mon, Jun 14, 2010 at 7:42 AM, Aran Donohue wrote:
> Hints? Tips?
One thing that isn't mentioned yet is to read other peoples programs.
I'm subscribed to the Hackage RSS feed[1]. I tend to read (at least)
the package page of every package that gets uploaded to hackage.
Whenever an interesting
On Jun 15, 6:27 am, Simon Marlow wrote:
> On 15/06/2010 06:09, braver wrote:
>
> > In fact, the tag cafe2, when run on the full dataset, gets stuck at 11
> > days, with RAM slowly getting into 50 GB; a previous version caused
> > ghc 6.12.1 to segfault around day 12 -- -debug showing an assert
> >
On Tue, Jun 15, 2010 at 7:23 PM, Martin Drautzburg
wrote:
> When I know my supplies I want to know what I can produce. When I know what I
> want to produce I want to know what supplies I need for that. Both kinds of
> questions should be answered by a singe Process thingy.
Your Process thingy rem
deliverable:
> > If you just want to optimize it and not compare exactly equal idiomatic
> > code,
> > you should stop using functional data structures and use a structure that
> > fits
> > your problem (the ST monad has been designed for that in Haskell), because
> > compilers do not detect sing
> If you just want to optimize it and not compare exactly equal idiomatic code,
> you should stop using functional data structures and use a structure that fits
> your problem (the ST monad has been designed for that in Haskell), because
> compilers do not detect single-threaded usage and rewrite a
On Tue, 15 Jun 2010 19:23:35 +0200, you wrote:
>When I know my supplies I want to know what I can produce. When I know what I
>want to produce I want to know what supplies I need for that. Both kinds of
>questions should be answered by a singe Process thingy.
>
>I want to be able to chain proces
On Tuesday, 15. June 2010 01:40:03 Luke Palmer wrote:
> So hang on, what is the problem? You have described something like a
> vague model, but what information are you trying to get? Say,
> perhaps, a set of possible output lists from a given input list?
When I know my supplies I want to know w
On Jun 15, 2010, at 6:11 PM, Sebastian Fischer wrote:
orElse :: CMaybe a a -> CMaybe a a -> CMaybe r a
CMaybe ca `orElse` CMaybe cb = CMaybe (\k -> (ca return `mplus` cb
return) >>= k)
Good point.
But with this restricted type `orElse` is less useful. For example,
one cannot compute
Hello Holger,
Can you define an associative operation
orElse :: CMaybe r a -> CMaybe r a -> CMaybe r a
with identity `mzero` that satisfies the cancellation law?
No, because that function would need to cancel values of type a, but
the arguments of type (CMaybe r a) can only compute value
Hi Sebastian,
Am 15.06.2010 um 17:06 schrieb Sebastian Fischer:
> Dear Café,
>
> `MonadPlus` instances are usually required to satisfy certain laws, among
> them the monad laws and monoid laws for `mzero` and `mplus`. Additionally one
> may require that (>>=f) is a monoid morphism, that is:
..ghci is able to generate the tagsfiles for you. This allows you to
jump to definitions of identifiers.
If you go this route, I will shamelessly promote hothasktags instead
of ghci. It generates proper tags for qualified imports.
What do you mean by "proper" here? GHCi has the information
I think Haskell would be an excellent choice.
Several reasons come to mind:
Given the arbitrary complexity of such projects, an EDSL describing book
entries etc would be a very good fit for the project. As people have said once
or twice, Haskell is a great fit for EDSLs
If you want to get
Its not indonesia, but the Singapore FP Users is pretty close by. We aren't
limited to just Haskell but there are several haskellers in the group. If
you'd like to join us, drop an email to:
singapore-functional-programm...@googlegroups.com
Max
On Jun 15, 2010, at 7:11 PM, leledumbo wrote:
Dear Café,
`MonadPlus` instances are usually required to satisfy certain laws,
among them the monad laws and monoid laws for `mzero` and `mplus`.
Additionally one may require that (>>=f) is a monoid morphism, that
is:
mzero >>= f = mzero
(a `mplus` b) >>= f = (a >>=
On 15 June 2010 15:13, Stephen Tetley wrote:
>
> There is actually no corresponding *lib* directory, but haddock still
> works fine.
This is a mistake on my part - I do have a corresponding lib directory
which includes a package.conf.d directory - for GHC-6.12.1 (I was
looking at the directory t
Hello all
I don't know if this helps at all, but for a GHC 6.12.1 installed from
the ghc-installer rather than HP I get:
Cygwin prompt on WinXP...
$ ./haddock.exe --print-ghc-libdir
C:\ghc\ghc-6.12.1\bin\..\lib
There is actually no corresponding *lib* directory, but haddock still
works fine.
B
I haven't been following closely, but how did you install haddock? From a binary dist? Is it possible that one of the Windows binary dists has a "baked-in" location for something on the E: drive, which existed on the packager's machine but not on the final installed machine?Regards,
MalcolmOn
2010/6/15 David Waern :
> 2010/6/15 Dominic Steinitz :
>> David Waern gmail.com> writes:
>>
>>> I think using --optghc=-package-conf is the correct way to point to
>>> another package DB, so I'll look into why it doesn't work.
>>
>> Perhaps another line of attack would be to see why haddock thinks
Hello Emmanuel,
Tuesday, June 15, 2010, 2:10:09 AM, you wrote:
> [f(a),f(b),f(c)] = g([a,b,c])
it looks a bit like vectorisation transformation in compilers
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
___
Has
2010/6/15 Dominic Steinitz :
> David Waern gmail.com> writes:
>
>> I think using --optghc=-package-conf is the correct way to point to
>> another package DB, so I'll look into why it doesn't work.
>
> Perhaps another line of attack would be to see why haddock thinks I have
> an "E:" drive?
Right.
I'm one of them :)
Nice to meet you...
vipex.id wrote:
>
> Hi, I'm new in Haskell & wondering is there Indonesian people using
> Haskell
> here.
>
> Nice meet* you all :)
>
> Regards,
> vipex
>
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haske
Op 14-06-10 07:00, braver schreef:
I'm computing a communication graph from Twitter data and then scan it
daily to allocate social capital to nodes behaving in a good karmic
manner. The graph is culled from 100 million tweets and has about 3
million nodes. First I wrote the simulation of the 35
On 15/06/2010 06:09, braver wrote:
In fact, the tag cafe2, when run on the full dataset, gets stuck at 11
days, with RAM slowly getting into 50 GB; a previous version caused
ghc 6.12.1 to segfault around day 12 -- -debug showing an assert
failure in Storage.c. ghc 6.10 got stuck at 30 days for g
On 12/06/2010 02:48, Don Stewart wrote:
igouy2:
parallel, regex-posix, regex-pcre are now installed and the current
compile errors are caused by the programs not the absence of required
libraries -
http://shootout.alioth.debian.org/u64q/program.php?test=binarytrees&lang=ghc&id=2#log
http://sh
Hi Amir,
Amiruddin Nagri wrote:
> My current project is about making an accounting engine...
Take a look at the related but different project "hledger".
http://hackage.haskell.org/package/hledger
http://hackage.haskell.org/package/hledger-lib
> consistency, handling large data(performance) and
> Message: 7
> Date: Mon, 14 Jun 2010 20:33:30 +0100
> From: Andrew Coppin
> Subject: Re: [Haskell-cafe] learning advanced haskell
> To: haskell-cafe@haskell.org
> Message-ID: <4c16840a.7060...@btinternet.com>
> Content-Type: text/plain; charset=ISO-8859-1; format=flowed
>
> John Lato wrote:
>
>>
It should be somewhere here ->
http://www.haskell.org/haskellwiki/Video_presentations
-Amir
On Tue, Jun 15, 2010 at 1:42 PM, Lyndon Maydwell wrote:
> I don't think I can be of much help with regards to the questions, but
> would you be able to post a link to the SPJ lecture?
>
> Thanks :-)
>
>
Thanks for the great responses. My haskell-learning todo list is refreshed
and renewed :)
I would point out, though, that had I followed a "Learn when needed"
philosophy more broadly I would never have come to Haskell or even
functional programming in general.
Aran
On Mon, Jun 14, 2010 at 12:33
I don't think I can be of much help with regards to the questions, but
would you be able to post a link to the SPJ lecture?
Thanks :-)
On Tue, Jun 15, 2010 at 4:08 PM, Amiruddin Nagri wrote:
>
> My current project is about making an accounting engine that handles all
> the journal entries, trans
My current project is about making an accounting engine that handles all
the journal entries, transactions, portfolios etc. The communication
with the engine is based on simple protocol, the things to be taken
care of in the order are consistency, handling large data(performance) and
availability.
Hi, I'm new in Haskell & wondering is there Indonesian people using Haskell
here.
Nice meet* you all :)
Regards,
vipex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
David Waern gmail.com> writes:
> I think using --optghc=-package-conf is the correct way to point to
> another package DB, so I'll look into why it doesn't work.
Perhaps another line of attack would be to see why haddock thinks I have
an "E:" drive?
__
On 15.06.2010, at 01:35, Luke Palmer wrote:
> On Mon, Jun 14, 2010 at 2:02 AM, Jean-Marie Gaillourdet
> wrote:
>> Hello,
>>
>> On 13.06.2010, at 22:32, Martin Drautzburg wrote:
>>
>>> I need your advice about how to browse code which was written by someone
>>> else
>>> (Paul Hudak's Euterpea,
50 matches
Mail list logo
