On Tue, Aug 4, 2009 at 11:05 PM, Max Rabkinmax.rab...@gmail.com wrote:
On Tue, Aug 4, 2009 at 11:56 PM, Magnus Therningmag...@therning.org wrote:
AIUI, on systems with working package managers, HP will be a
metapackage which depends on the appropriate real packages.
Yes, but again, the role
Hello Magnus,
Wednesday, August 5, 2009, 11:37:23 AM, you wrote:
I don't know of any other way either. I just strongly oppose the idea
that HP should take on the role of providing C lib bindings just
because on some platforms it's hard to satisfy the C dependencies.
those some platfroms are
Hello,
On Tue, Aug 4, 2009 at 2:50 PM, Neil Mitchellndmitch...@gmail.com wrote:
Hi
Some good reasons for having a separate interface are: they can be
human-readable and human-writable (ghc's do not fulfill this criterion);
they can be used to bootstrap mutually recursive modules in the
On Wed, Aug 5, 2009 at 8:59 AM, Bulat
Ziganshinbulat.zigans...@gmail.com wrote:
Hello Magnus,
Wednesday, August 5, 2009, 11:37:23 AM, you wrote:
I don't know of any other way either. I just strongly oppose the idea
that HP should take on the role of providing C lib bindings just
because on
-- based on http://jtauber.com/blog/2008/02/10/a_new_kind_of_graded_reader/
-- TODO: read knownwords from file
-- print out matching sentences as well (make optional)
-- fix performance; goal: handle Frank Herbert corpus in under 5 minutes
-- benchmark parallelism; is it gaining
A while ago I wrote this rather pedantic html library (it guarantees
standards compliance via types, even down to the nesting restrictions).
I announced it on the libraries list, but chronic fatigue gets in the
way of following things up, so I haven't taken it any further until
recently. And
Hi Gwern,
gwern0 wrote:
...efficiency is an issue.
Here are a few efficiency issues that I noticed in your algorithm
after a quick look (none of these have to do with Haskell really):
o ranks sorts the entire set, then discards all but the maximum.
It would be better to use maximum or
Hello
It seems like a very common issue to have an API like:
foo :: String - Foo
fooBS :: ByteString - Foo
fooLBS:: L.ByteString - Foo
is there currently a library that makes unifying them easy?
Below is attached one try at this, does it make sense? I'm thinking of
uploading it to Hackage
On Wed, Aug 5, 2009 at 1:24 PM, Taru Karttunen tar...@taruti.net wrote:
Hello
It seems like a very common issue to have an API like:
foo :: String - Foo
fooBS :: ByteString - Foo
fooLBS:: L.ByteString - Foo
is there currently a library that makes unifying them easy?
They cannot be
Hi,
i am replying to a thread called Data.List permutations on ghc-
users and a thread called powerSet = filterM (const [True,
False]) ... is this obfuscated haskell? on haskell cafe.
On 04.08.2009, at 19:48, Slavomir Kaslev wrote:
A friend mine, new to functional programming, was
for some changes of .hs file (where just
the implementation changes) the .o file can be regenerated without
touching the .hi file. This allows more accurate build dependencies
and less recompilation.
Is that really the case? I thought that GHC may add code to the
interface files for
My measurements show that
- using strict version of insertWith doesn't improve performance. - in case
of compilation with -O2 flag foldl' also is equal to foldl (-O2 gives approx
2 time impovements).- using RandomGen and State monad to generate a list
gives at least 4 times improvements (on 1 000
I agree with most of Alexander's many thoughtful comments
about Don's list of potential additions to HP. But I
disagree about pandoc.
Alexander Dunlap wrote:
No. Pandoc is too actively developed to go into the HP.
It depends on the nature of the development. If the
API is currently very
Hi
is there currently a library that makes unifying them easy?
I currently use this library:
http://community.haskell.org/~ndm/darcs/tagsoup/Text/StringLike.hs
Not yet released, and rather specific to what I was wanting to do, but
does work for me. I'm happy for people to steal bits from that
Excerpts from Neil Mitchell's message of Wed Aug 05 16:36:06 +0300 2009:
I currently use this library:
http://community.haskell.org/~ndm/darcs/tagsoup/Text/StringLike.hs
It looks nice but is not really a solution for passing large amounts
of data efficiently. Converting everything to String
Dmitry Olshansky wrote:
My measurements show that...
(-O2 gives approx 2 time impovements).
...using RandomGen and State monad to generate a list gives at least 4 times
improvements (on 1 000 000 items).
You earlier said:
this takes over twice as long as a naively implemented
Python program
Tom Tobin wrote:
As I understand it, Pandoc is entirely under the GPL (not LGPL).
Oh. That would be an issue, yes. Too bad.
Thanks,
Yitz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Tom == Tom Tobin korp...@korpios.com writes:
Tom As I understand it, Pandoc is entirely under the GPL (not
Tom LGPL). I'd be very wary of accepting a GPL'd library as a
I'd be very upset if pandoc weren't blessed.
Tom blessed standard library, since it would be completely
Tom
On Wed, Aug 5, 2009 at 10:19 AM, Colin Paul
Adamsco...@colina.demon.co.uk wrote:
Just because a library is blessed, doesn't mean you have to use it.
Then I'm not sure I understand the point of blessing it in a set of
libraries that saves you the task of picking and choosing the best
Haskell
2009/8/5 Yitzchak Gale g...@sefer.org:
Dmitry Olshansky wrote:
My measurements show that...
(-O2 gives approx 2 time impovements).
...using RandomGen and State monad to generate a list gives at least 4 times
improvements (on 1 000 000 items).
You earlier said:
this takes over twice as
Tom == Tom Tobin korp...@korpios.com writes:
This can surely be tackled by cabal, as it already has the
license information.
Tom I don't see this as a real solution; why would a package be
It should be done anyway, irrespective of the platform.
Tom added to the platform in
Hi all,
I've been playing with multiparameter typeclasses recently and have
written a few uncallable methods in the process. For example, in
class Moo a b where
moo :: a - a
the moo function is effectively impossible to call (no amount of type
annotations can tell the compiler what you
Nobody?
On Tue, Aug 4, 2009 at 10:06 AM, Levi
Greenspangreenspan.l...@googlemail.com wrote:
Dear list members,
In February this year there was a posting Why does sleep not work?
(http://www.haskell.org/pipermail/haskell-cafe/2009-February/055400.html).
The problem was apparently caused by
On Wed, Aug 5, 2009 at 10:46 AM, Colin Paul
Adamsco...@colina.demon.co.uk wrote:
Tom == Tom Tobin korp...@korpios.com writes:
This can surely be tackled by cabal, as it already has the
license information.
Tom I don't see this as a real solution; why would a package be
It should
Hi
It looks nice but is not really a solution for passing large amounts
of data efficiently. Converting everything to String creates too much
overhead for large chunks of data.
There is uncons, which never creates big strings. But yes, adding more
bulk operations (i.e. lookup) might be
I wrote:
You can get the whole thing with
darcs get --partial
http://homepage.ntlworld.com/jon.fairbairn/Typeful/Text/nHTMLs
but that was a temporary url that I copied and pasted. The correct one:
darcs get --partial
http://homepage.ntlworld.com/jon.fairbairn/Typeful/Text/HTMLs
And I
Tom is exactly right here. GPL is the kiss of death in the commercial
world. Haskell Platform exists in part to encourage industry use of
Haskell -- and to encourage braindead use of blessed libraries. GPL
libraries have no place in HP.
Regards,
John A. De Goes
N-Brain, Inc.
The
On Wed, 5 Aug 2009 11:03:55 -0500
Tom Tobin korp...@korpios.com wrote:
On Wed, Aug 5, 2009 at 10:46 AM, Colin Paul
Adamsco...@colina.demon.co.uk wrote:
Tom == Tom Tobin korp...@korpios.com writes:
This can surely be tackled by cabal, as it already has the
license information.
And even if you don't agree with that, it would likely lead to
accidental use of GPL software in proprietary software, which is not a
good thing.
--
Robin
On Wed, 5 Aug 2009 09:33:34 -0700
John A. De Goes j...@n-brain.net wrote:
Tom is exactly right here. GPL is the kiss of death in the
Hello Daniel,
Wednesday, August 5, 2009, 8:00:06 PM, you wrote:
class Moo a b where
moo :: a - a
instances. Another solution would be to artificially force moo to take
a dummy b so that the compiler can figure out which instance you
meant. That's what I've been doing in the mean time,
Daniel Peebles wrote:
I've been playing with multiparameter typeclasses recently and have
written a few uncallable methods in the process. For example, in
class Moo a b where
moo :: a - a
the moo function is effectively impossible to call (no amount of type
annotations can tell the
bulat.ziganshin:
Hello Magnus,
Wednesday, August 5, 2009, 11:37:23 AM, you wrote:
I don't know of any other way either. I just strongly oppose the idea
that HP should take on the role of providing C lib bindings just
because on some platforms it's hard to satisfy the C dependencies.
gale:
Other batteries included platforms contain
various tools for processing markup that are
far less general than pandoc. This is a place
where Haskell can shine.
So yes, pandoc should definitely be included
in the platform. All that said, though, I will
certainly agree that it is not
Hi everybody,
suppose I have two different parsers: one just reads the string, and another
one parses some values from it. E.g.:
parseIntList :: Parser [Integer]
parseIntList = do
char '('
res - liftM (map read) (sepBy1 (many1 digit) (char ';'))
char ')'
return res
parseIntString ::
Well, I was too optimistic saying I can return the updated state. I don't
know how to do that actually. Maybe someone else here knows?
2009/8/5 Paul Sujkov psuj...@gmail.com
Hi everybody,
suppose I have two different parsers: one just reads the string, and
another one parses some values from
Hello all,
I'm new to Haskell, but have a good background in LISP/Scheme and do
mostly C/C++ programming on a daily basis. I'm learning Haskell mainly
because it provides facilities for concurrency on the language level,
and I'm mainly interested in implementing parallel or massively
parallel
Hi there,
If I import a module and do not explicitly point out the entities I have
imported. And I want the ghc to point out the entities automatically. Is
there any method to do this? any methods to have the ghc point out the
entities I import and export?
Because there are so many files and I
Hi all,
is there an SQL Database in Haskell or is there a project trying to
implement one?
Günther
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Adding a dummy argument is what I've been doing so far, but it feels
hackish. Typeclasses add an implicit parameter containing the
dictionary of methods, and it seemed reasonable for me to have a more
direct influence over its value. If I must add another explicit
parameter to specify which
Hello Thomas,
Wednesday, August 5, 2009, 9:59:00 PM, you wrote:
because it provides facilities for concurrency on the language level,
and I'm mainly interested in implementing parallel or massively
parallel algorithms with Haskell. I have two questions that bother me.
if you plan to
It would be nice to have a place for anonimous
comments below each page of a hackage package, maybe
with a cabal option to enable/disable that for a
particular package. Authors of packages with few
users may want that as a way to get first impressions
on their work they would otherwise not get.
On Wed, Aug 5, 2009 at 6:59 PM, Thomas Witzel witzel.tho...@gmail.comwrote:
2. I started with the very simple nfib example given in the manual for
Control.Parallel (Section 7.18). On my systems using multiple cores
makes the code actually slower than just using a single core. While
the
I got the impression Dmitry was using Haskell's standard RNG, not
Mersenne Twister. If so, then we'd get further improvements with MT,
but that's still a hit against Haskell, as I'd interpret it as meaning
that Haskell supplies as default a PRNG which costs noticeable
performance in order to
Hello all,
I need a convenient tool to generate Haskell types from XML W3C Schema
Definition (xsd) and vice versa - generate instances for Haskell ADT's to
make corresponding XML.
It is just the same that HaXml do with DTD.
I need
- using XSD
- support for unicode
- using xml-attributes as far as
2009/8/5 xu zhang douy...@gmail.com:
Hi there,
If I import a module and do not explicitly point out the entities I have
imported. And I want the ghc to point out the entities automatically. Is
there any method to do this? any methods to have the ghc point out the
entities I import and
gue.schmidt:
Hi all,
is there an SQL Database in Haskell or is there a project trying to
implement one?
There are several bindings,
http://hackage.haskell.org/packages/archive/pkg-list.html#cat:database
Are you asking for an implementation of SQL though?
-- Don
I think parsecMap does the job here:
---
import Text.ParserCombinators.Parsec hiding ((|))
import Text.Parsec.Prim(parsecMap)
import Control.Applicative((|))
import Control.Arrow((|||),())
-- Tagged (:)
() :: Either Char Char - Either String String - Either String String
Hi Don,
I actually meant an SQL database written in Haskell, same as Derby or
HSQLDB in Java.
I'm currently using Sqlite3 with HDBC but would prefer one entirely in
Haskell (but still SQL though, because of persistence and performance).
Günther
Am 05.08.2009, 22:32 Uhr, schrieb Don
On Aug 5, 2009, at 14:37 , Maurí cio CA wrote:
It would be nice to have a place for anonimous
In these days of web spam, anonymous is not such a good idea.
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allb...@kf8nh.com
system administrator [openafs,heimdal,too many hats]
It would be nice to have a place for anonimous
In these days of web spam, anonymous is not such a good idea.
Sure! Replace anonymous for easy to write. Although,
thinking better, this should be something to ask at repository
hosters, not at hackage.
Best,
Maurício
Of course, since ParsecT s u m is a functor, feel free to use fmap
instead of parsecMap. Then you don't need to import from Text.Parsec.Prim.
And in hindsight, I might prefer the name (:) or cons to () for the
first function, but now I'm just obsessing. :)
Dan
Dan Weston wrote:
I think
2009/8/5 Maurício CA mauricio.antu...@gmail.com:
Sure! Replace anonymous for easy to write. Although,
thinking better, this should be something to ask at repository
hosters, not at hackage.
If we're getting rid of the anonymous requirement - every package I
upload to hackage includes my
Paul Moore wrote:
2009/8/5 Yitzchak Gale g...@sefer.org:
Or is this with an alternate RNG? Although I think even that
would be fair, since Python uses Mersenne.
I got the impression Dmitry was using Haskell's standard RNG, not
Mersenne Twister. If so, then we'd get further improvements with
Hello Dmitry,
I too was looking for something like this and came up empty. I
proposed something similar on the haskell_proposals reddit...
http://www.reddit.com/r/haskell_proposals/comments/8zhkx/haxb_and_haxws/
... but I was left with the impression that there isn't much interest.
-Keith
On
On Thu, 2009-08-06 at 00:04 +0200, Günther Schmidt wrote:
Hi Don,
I actually meant an SQL database written in Haskell, same as Derby or
HSQLDB in Java.
I'm currently using Sqlite3 with HDBC but would prefer one entirely in
Haskell (but still SQL though, because of persistence and
moonlite:
On Thu, 2009-08-06 at 00:04 +0200, Günther Schmidt wrote:
Hi Don,
I actually meant an SQL database written in Haskell, same as Derby or
HSQLDB in Java.
I'm currently using Sqlite3 with HDBC but would prefer one entirely in
Haskell (but still SQL though, because of
Hi,
well I tried to do some stuff in memory, and the app ended up using a
couple of gigs. I not only have a very large amount of dynamic data, CSV
files, but also quite a large amount of static data, and wasted 3 months
trying to do this all in-memory. The problem was finally solved once I
gue.schmidt:
Hi,
well I tried to do some stuff in memory, and the app ended up using a
couple of gigs. I not only have a very large amount of dynamic data, CSV
files, but also quite a large amount of static data, and wasted 3 months
trying to do this all in-memory. The problem was
Hi all,
I appreciate all the suggestions but I'd like to stress that in this
particular case, the app I'm developing, SQL has proven to be the ideal
solution, the input data is table based, I need to group, find maxes, do
joins, whathaveyou. SQLite did miracles to memory problems and
Sure! Replace anonymous for easy to write. [...]
[...] every package I upload to hackage includes my email
address in the maintainer field, and I love getting emails
from people who use anything I maintain (even if they're asking
me to do work! I may not do it, but it's nice to know that
I've beeing writing a low-level binding to posix that can be
usefull if you want to use posix but has no time to learn FFI:
http://hackage.haskell.org/package/bindings-posix
However, my understandment of posix is barely nothing, and I see
that many of its functionality is enabled or disabled by
Hi haskellers:
There is a mistake in http://www.haskell.org/haskellwiki/State_Monad
It post two functions like this :
evalState :: State s a - s - a
evalState act = fst $ runState act
execState :: State s a - s - s
execState act = snd $ runState act
Both the '$' operators should be
leaveye.guo:
Hi haskellers:
There is a mistake in http://www.haskell.org/haskellwiki/State_Monad
It post two functions like this :
evalState :: State s a - s - a
evalState act = fst $ runState act
execState :: State s a - s - s
execState act = snd $ runState act
Both the
I'd be very interested to see a rdbms implementation in Haskell ... perhaps a
port of sqlite
Regards,
Kashyap
From: Don Stewart d...@galois.com
To: Günther Schmidt gue.schm...@web.de
Cc: haskell-cafe@haskell.org
Sent: Thursday, August 6, 2009 6:07:48 AM
As I can say from my experience of usage of hdbc-sqlite3 and
happstack-state, the latter covers everything you ever wanted from
sqlite3 and more. It you aren't too concerned about performance, you
can free yourself from many tedious routines that are imminent when you
work with relational
65 matches
Mail list logo
