On 4 August 2010 10:42, Rogan Creswick cresw...@gmail.com wrote:
Haskell has very limited support for high-level Natural Language
Processing [snip]
This isn't a fault of the language, it just
I have some hope that jvm-bridge can be resurrected to bind to
OpenNLP, but that's something I've
On 2 August 2010 16:24, Jean-Philippe Bernardy berna...@chalmers.se wrote:
Can you explain why you could not use the parsec name,
with revision number (say) 2.2?
This would help improve hackage/cabal/... versioning mechanism.
I think the idea is to give it more prominence: if you go to
On 3 August 2010 15:02, rustom rustompm...@gmail.com wrote:
I tried to install pivotal
According to the site I must do:
ghc --make Main -fglasgow-exts -package plugins
I get
cant satisfy package plugins
Which version of GHC are you using? If you're using 6.12, then you're
out of luck:
On 1 August 2010 20:43, Ertugrul Soeylemez e...@ertes.de wrote:
Ivan Lazar Miljenovic ivan.miljeno...@gmail.com wrote:
No, a pure function is one without any side effects.
There are no functions with side effects in Haskell, unless you use
hacks like unsafePerformIO. Every Haskell function
On 2 August 2010 14:47, Lyndon Maydwell maydw...@gmail.com wrote:
I thought it was pure as, conceptually, readFile isn't 'run' rather it
constructs a pure function that accepts a unique world state as a
parameter. This might be totally unrealistic, but this is how I see IO
functions remaining
On 2 August 2010 14:59, Lyndon Maydwell maydw...@gmail.com wrote:
That's true I suppose, although since there are no implicit parameters
in haskell, it really has to be a DSL in implementation, rather than
just theory right?
On 30 July 2010 13:32, Peter Schmitz ps.hask...@gmail.com wrote:
I have a question about finding the Gtk2Hs demos (the demos written in
Haskell).
They're not there:
http://osdir.com/ml/haskell-cafe@haskell.org/2010-07/msg00724.html
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
On 28 July 2010 12:39, michael rice nowg...@yahoo.com wrote:
How do I import Control.Monad.State?
Install and use the mtl library (comes with the Haskell platform),
monads-fd (almost identical API to mtl; the point of this is that mtl
uses some extension: the non-extension bits are in the
On 28 July 2010 13:03, michael rice nowg...@yahoo.com wrote:
[mich...@localhost ~]$ ghc-pkg list mtl
/usr/lib/ghc-6.12.1/package.conf.d
[mich...@localhost ~]$
Installed?
No; if it was installed it would specify a version.
Michael
--- On Tue, 7/27/10, Ivan Miljenovic ivan.miljeno
, now you can use import Control.Monad.State.
Michael
--- On Tue, 7/27/10, Ivan Miljenovic ivan.miljeno...@gmail.com wrote:
If it isn't installed, you can use cabal-install to install it:
cabal install mtl
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
On 28 July 2010 14:07, aditya siram aditya.si...@gmail.com wrote:
I didn't realize the State monad wasn't part of the base install. Any
particular reason for this?
Because there's no reason for it to be? GHC is bundled with enough
libraries as it is (and with the exception of Cabal, it's not
On 26 July 2010 16:33, David Virebayre dav.vire+hask...@gmail.com wrote:
On Sun, Jul 25, 2010 at 11:53 PM, Edward Z. Yang ezy...@mit.edu wrote:
An interesting alternate spin on flip is infix notation combined with partial
application, such as:
(`foobar` 3)
which is equivalent to
\x
On 26 July 2010 00:48, grzyb zbigniew.grzy...@gmail.com wrote:
Hi,
I'm a beginner in haskell, I was trying to write the following code, but I
still encourage some problems, can you help me with that?
I need to read a large file and try to match each line to a pattern which is
int,int
On 25 July 2010 05:50, Tobias Brandt tob.bra...@googlemail.com wrote:
You have to fix the type of 1 and 6, e.g. by writing
x - randomRIO (1, 6) :: IO Int
or
x - randomRIO (1, 6 :: Int)
GHCi defaults integral numbers to Int, that's why it works there.
The default numeric type is Integer,
On 23 July 2010 02:31, Daniel Fischer daniel.is.fisc...@web.de wrote:
On Thursday 22 July 2010 18:23:32, Stephen Tetley wrote:
Hiding unmaintained libraries seems contrary to Hackage's spirit - if
you want to depend on an unmaintained library why not volunteer to be
the maintainer.
I think
On 22 July 2010 18:33, David Waern david.wa...@gmail.com wrote:
[snip]
We currently only support concrete examples (i.e. unit tests), but the
plan is to add support for QuickCheck properties.
Would you have some kind of inbuilt time limit (similar to what mueval
has) for very long/complex QC
On 21 July 2010 15:28, Richard O'Keefe o...@cs.otago.ac.nz wrote:
I'm giving some lectures this week about how to _read_ programs,
and I've had some things to say about JavaDoc and wondered whether
to show some examples of Haddock.
I took a certain library that has been mentioned recently in
On 18 July 2010 23:35, Ivan Lazar Miljenovic ivan.miljeno...@gmail.com wrote:
* Someone's asked me why I don't define a Traversable-like class. The
reason is is that I haven't gotten around to it yet ;-) (as well as a
great many other things).
Ugh, I got Traversable mixed up with Foldable
On 19 July 2010 04:16, Don Stewart d...@galois.com wrote:
Hackage doesn't yet provide support for changelogs. However, it does
provide support for repository links, from which we can construct a
changelog. That's right: you have to read each repo to get the full
changelog, unless the author
On 19 July 2010 14:31, Jonathan Geddes geddes.jonat...@gmail.com wrote:
Now when I'm working in a subdirectory, say Foo where the modules are
named Foo.Bar, Foo.Baz, Foo.etc., and I try to compile Bar.hs which
imports Foo.Baz, the compiler looks for the file Foo/Baz.hs. The
problem is that I'm
Thank you for all the people who have voted; we so far have 42 results
in about 12 hours.
Some indication of the results so far:
* 62% prefer inductive-graphs
* 62% have indicated that they use fgl or do some graph-related stuff
(no correlation, just an interesting coincidence; I have not as
On 14 July 2010 14:52, bri...@aracnet.com wrote:
Short version of this post:
Looks like the intsall depends on alex and that dependencies doesn't
appear to be handled, i.e. I had to install alex before proceeding.
Yes, cabal-install isn't able to cope with the build-tools dependencies.
why
On 12 July 2010 13:04, Max Cantor mxcan...@gmail.com wrote:
Is there a reason that EnumMap specifically requires containers 0.3 or just
a matter of not having been tested? It seems to compile just fine (but with
one warning for a deprecated call).
Because it hasn't been updated since
On 8 July 2010 17:07, a...@spamcop.net wrote:
G'day all.
Quoting Ertugrul Soeylemez e...@ertes.de:
Do you realize at what level we are complaining?
Yes, we're complaining at the level of the frustrated idealist, which is
what many Haskell programmers are.
So true... :-(
/me is still
On 8 July 2010 10:55, Hector Guilarte hector...@gmail.com wrote:
Hey everyone,
I'm making a Game Monad for an assignment (yes, homework) . Here's a little
explanation of what I need to do (I can't use anything from Control.Monad.*,
I need to do everything myself):
I need to define my newtype
On 8 July 2010 13:36, Ertugrul Soeylemez e...@ertes.de wrote:
To be honest, I don't know any strength of MTL compared to transformers
and monadLib. Actually even transformers is quite primitive compared to
monadLib. The only real advantage is that it has flipped run functions
and a built-in
On 8 July 2010 13:48, Ertugrul Soeylemez e...@ertes.de wrote:
Ivan Miljenovic ivan.miljeno...@gmail.com wrote:
On 8 July 2010 13:36, Ertugrul Soeylemez e...@ertes.de wrote:
To be honest, I don't know any strength of MTL compared to
transformers and monadLib. Actually even transformers
Graphviz (http://graphviz.org/) has the option to convert provided Dot
code for visualising a graph into a canonical form. For example, take
the sample Dot code:
| digraph foo {
| a [color=blue];
| subgraph cluster_bar {
| a [label=hi!]
| b [color=blue, label=bye!];
On 2 July 2010 16:57, Joachim Breitner m...@joachim-breitner.de wrote:
Am Freitag, den 02.07.2010, 12:55 +1000 schrieb Ivan Miljenovic:
This can be resolved by putting the build-depends line in the if
statement (and should maybe put up the top of the executable section
to make it more
On 1 July 2010 16:04, Christopher Tauss ctau...@gmail.com wrote:
Hello -
I just a day or so ago downloaded Hakell and am playing around with it, and
I came upon this problem with WinGHCi:
I am able to enter a multi-line do statement that works if I use brackets
and semi-colon like so:
On 1 July 2010 19:16, Tom Doris tomdo...@gmail.com wrote:
According to the criterion.cabal file shipped with the latest (0.5.0.1)
version of criterion, the Chart package is broken under GHC 6.12:
When Bryan last released Criterion, gtk2hs (and hence Chart) was
unbuildable on GHC 6.12 (which was
On 1 July 2010 17:25, Vincent Hanquez t...@snarc.org wrote:
The main reason for this library is the lack of incremental api exposed by
current digest libraries, and filling the void about some missing digest
algorithms; Also the speed comes as a nice bonus.
Can you explain what you mean by
On 2 July 2010 04:48, David Menendez d...@zednenem.com wrote:
Maybe you're thinking of equality superclasses. In another thread,
this example came up:
| class (DerivedOf a ~ derived) = Typecheck a derived where
which doesn't work yet, but should work in 6.14.
I've asked Manuel Chakravarty
On 29 June 2010 15:20, Michael Snoyman mich...@snoyman.com wrote:
As far as I know, the only issue with depending on both is the conflicting
orphan Monad instance for Either. Can anyone either confirm or deny this?
Since you're being naughty and using package-qualified imports, it
should be OK
On 29 June 2010 15:38, Michael Snoyman mich...@snoyman.com wrote:
On Tue, Jun 29, 2010 at 8:24 AM, Ivan Miljenovic ivan.miljeno...@gmail.com
wrote:
On 29 June 2010 15:20, Michael Snoyman mich...@snoyman.com wrote:
As far as I know, the only issue with depending on both is the
conflicting
On 28 June 2010 05:52, Victor Nazarov asviraspossi...@gmail.com wrote:
Having this in my mind I've decided that this code should be
rewritten without undefined being mentioned. But I need some
type signature and it should mention Int type. So I've got an
idea about what I've called fantom type
On 24 June 2010 16:57, Don Stewart d...@galois.com wrote:
Some people might be quite excited by Milan's work on significant
performance improvements to the containers package...
This looks quite nice; good work Milan!!!
As an aside, Alex Mason and I are discussing the possibility of taking
On 24 June 2010 17:15, Stephen Tetley stephen.tet...@gmail.com wrote:
There are some classes for bulk types in Simon Peyton-Jones's paper
Bulk Types with Class.
Cool, I'll have a look.
Personally, I'll take a lot of convincing that a class approach will
be better than using the module
On 24 June 2010 17:55, Stephen Tetley stephen.tet...@gmail.com wrote:
On 24 June 2010 08:20, Ivan Miljenovic ivan.miljeno...@gmail.com wrote:
My rational for a class approach is that rather than having your
library spit out a list of values, etc. you let the consumer pick
which data type
On 25 June 2010 10:57, Frank Moore fmo...@gmail.com wrote:
Hello Haskellers,
I am new to programming in Haskell and I am having trouble understanding
exactly when statements become evaluated. My goal is to try and measure how
long a computation takes without having to use a show function.
On 25 June 2010 11:19, Frank Moore frankmo...@math.cornell.edu wrote:
Thanks for the reply.
My main is now:
main = do
let as = [1..2e7] :: [Double]
start - getCurrentTime
let meanAs = mean as
let meanOver2 = meanAs `deepseq` meanAs / 2
end - getCurrentTime
putStrLn (show
On 25 June 2010 12:32, braver delivera...@gmail.com wrote:
Simon -- so how can I get me a new ghc now? From git, I suppose? (It
used to live in darcs...)
Still does if I recall correctly.
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.wordpress.com
On 25 June 2010 14:41, David Menendez d...@zednenem.com wrote:
On Thu, Jun 24, 2010 at 3:08 AM, Ivan Miljenovic
ivan.miljeno...@gmail.com wrote:
As an aside, Alex Mason and I are discussing the possibility of taking
advantage of AusHack *shameless plug* to write some kind of classes
For those others like me who have no idea what s-record files are:
http://en.wikipedia.org/wiki/S-record
On 23 June 2010 03:36, Tom Hawkins tomahawk...@gmail.com wrote:
A little library for reading s-record files:
http://hackage.haskell.org/package/srec
-Tom
On 23 June 2010 13:46, Evan Laforge qdun...@gmail.com wrote:
I have a parameterized data type:
data Val result = VNum Double | VThunk (SomeMonad result)
type Environ result = Map Symbol (Val result)
I have a class to make it easier to typecheck Vals:
class Typecheck a where
from_val ::
On 22 June 2010 03:18, John Lask jvl...@hotmail.com wrote:
I just want my nice neat layout back. I have just spent an inordinate amount
of time updating code when if the parser recognised do rec as a recursive
group it would have been a drop in replacement and taken me one tenth of the
time.
On 16 June 2010 16:00, Michael Snoyman mich...@snoyman.com wrote:
On Wed, Jun 16, 2010 at 8:51 AM, Ivan Miljenovic ivan.miljeno...@gmail.com
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
On 16 June 2010 15:45, Roman Cheplyaka r...@ro-che.info wrote:
* aditya siram aditya.si...@gmail.com [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
Last night (AEST), Edward Kmett semi-convinced (in the sense that I'm
not sure whether his examples are really those that someone would
want/need or just thinking of possible future problems) me that some
users may have a need for FGL to keep having explicit graphs with kind
* - * - *.
With his
On 10 June 2010 12:38, sterl s.clo...@gmail.com wrote:
There's a big range of issues here, and to be honest I'm not sure if our
ability to distinguished between them is helped by the title of this thread,
which somewhat begs the question. That is to say, it isn't clear to me that
calling the
On 10 June 2010 14:28, Arnaud Bailly arnaud.oq...@gmail.com wrote:
I did:
ghc-pkg unregister bytestring-0.9.1.6
then restarted emacs and it works now. Don't now if ther weill be
side-effects on other packages...
ghc-pkg check will tell if you if there are any breakages.
--
Ivan Lazar
On 9 June 2010 12:11, Jason Dagit da...@codersbase.com wrote:
Or write translator tools for upgrading to the new API :) Pipe dream?
Maybe.
Too an extent, yes: the types are more generalised so it's going to be
difficult to do automatic translations.
However, Thomas has demonstrated that you
Thomas Bereknyei are currently re-writing fgl (just about completely
from scratch) and we plan to make an initial release to get feedback
on the API in the next few weeks.
However, I'm sending this email out now to warn people that I highly
doubt any code that was written for the current version
On 6 June 2010 00:37, Maciej Piechotka uzytkown...@gmail.com wrote:
PDF is not just simplified, compressed encoding of PostScript. Or at
least - LaTeX have some features PDF-only.
For example PDF can have hyper-links (both to local and external
content). It can be scripted in JavaScript
On 4 June 2010 00:57, Ryan Newton new...@mit.edu wrote:
What's the easiest reference for how to build GHC head and get it up
and running with cabal/haskell-platform?
I simply installed 6.12 + haskell-platform then built ghc-6.13.xx and
rebuilt only the packages I needed with cabal install
On 4 June 2010 03:18, Ozgur Akgun ozgurak...@gmail.com wrote:
On 3 June 2010 16:14, Gabriel Riba griba2...@gmail.com wrote:
Maybe we could take out importance on the number of _ wildcards
(constructor
arity) with a syntax like.
li @ (Cons ...)
li @ (Nil ...)
can't you
On 4 June 2010 10:27, Jens Petersen peter...@haskell.org wrote:
On 31 May 2010 20:14, Pete Chown 1...@234.cx wrote:
I was just thinking, interactions between Cabal and the distribution package
manager could get worse, as shared Haskell libraries become more common.
Suppose a distribution
On 31 May 2010 20:14, Pete Chown 1...@234.cx wrote:
I was just thinking, interactions between Cabal and the distribution package
manager could get worse, as shared Haskell libraries become more common.
Suppose a distribution ships a package 'foo', but not a package 'bar' which
depends on it.
On 3 June 2010 00:37, Ben Millwood hask...@benmachine.co.uk wrote:
It's worth noting, though, that cabal-install doesn't track installed
packages itself, GHC does.
And this is why cabal-install can't tell you when there are new
versions of executable-only packages (e.g. happy) available: it
Sorry for the double-reply Matthias, but I forgot to CC -cafe (GMail
labs isn't working, so reply-to-all is no longer the default for me :(
).
On 3 June 2010 13:10, Matthias Reisner matthias.reis...@googlemail.com wrote:
there's something wrong with port numbers in the Network.Socket module of
On 27 May 2010 16:46, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
I only have one alex installed under ~/.cabal/bin.
It seems working with shell environment, but not cabal.
This sounds like a similar problem to one that occurred a couple of months ago.
If you use ~/.cabal/bin/
On 27 May 2010 17:55, Michael Snoyman mich...@snoyman.com wrote:
Two comments:
* The exclamation point seems good enough for attributes. I copied that for
Hamlet as well.
* If you're standardizing on UTF-8, why not support bytestrings? I'm aware
that a user could shoot him/herself in the foot
On 27 May 2010 18:23, Michael Snoyman mich...@snoyman.com wrote:
On Thu, May 27, 2010 at 11:16 AM, Ivan Miljenovic
ivan.miljeno...@gmail.com wrote:
On 27 May 2010 17:55, Michael Snoyman mich...@snoyman.com wrote:
Two comments:
* The exclamation point seems good enough for attributes. I
On 27 May 2010 18:33, Michael Snoyman mich...@snoyman.com wrote:
I don't do any string concatenation (look closely), I was very careful to
avoid it. I tried with lazy text as well: it was slower. This isn't
surprising, since lazy text- under the surface- is just a list of strict
text. And the
On 28 May 2010 09:37, Richard O'Keefe o...@cs.otago.ac.nz wrote:
On May 27, 2010, at 11:50 PM, Yitzchak Gale wrote:
agree100 = (==) `on` for [1..100]
Search for on and for in the Haskell 98 Report and you
will not find them. If you want to tell someone to use them,
you ought to tell them
On 28 May 2010 14:52, Richard O'Keefe o...@cs.otago.ac.nz wrote: Yes,
that kind of thing.
Remember, this was a BEGINNER-type question.
If one is giving a *serious* answer, it has to be an answer a
beginner (who has almost certainly never heard of Traversable)
can make sense of, and if it uses
On 28 May 2010 15:18, wren ng thornton w...@freegeek.org wrote:
Stefan Monnier wrote:
churchedBool :: t - t - t
Important detail: the precise type is ∀t. t → t → t.
encodeBool x = \t e - if x then t else e
So the type of encodeBool should be:
Bool → ∀t. t → t → t
whereas Haskell will
On 25 May 2010 16:12, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
Yes, this code works with a little hack. Thank you.
I'm scared to ask: what pray tell is this little hack?
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.wordpress.com
On 25 May 2010 11:41, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
Hi,
I have a file including some operation logs, in the format of the
following. And I have some code to analyze it. Well, it ate all my
memories.
---
log:
Log for item A
===
09:10 read accountA
On 25 May 2010 12:02, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
U is for UTF8 module. And I will try the modules you mentioned.
Although I thought Haskell IO is lazy enough
If you're only streaming data, it probably would be. However, you
seem to keep some of it in memory,
On 25 May 2010 12:20, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
This is the function. The problem sure seems like something was
preserved unexpected. But I cannot find out where is the problem.
seperateOutput file =
let content = lines file
indexOfEachOutput_ = fst $
On 24 May 2010 11:13, Sam Martin sam.mar...@geomerics.com wrote:
Hi!
I'm trying to work out the best way to generate (ideally derive) instances
for the Fix type. Here's a cut down example:
data Greet x = AlloAllo x x | AuRevoir deriving Show
newtype Fix f = In { out :: f (Fix f) } --
On 20 May 2010 14:42, Tony Morris tonymor...@gmail.com wrote:
We all know that class (Functor f) = Monad f is preferable but its
absence is a historical mistake. We've all probably tried once:
instance (Functor f) = Monad f where
Do you mean the reverse of this (instance (Monad m) = Functor m
This looks suspiciously like homework...
2010/5/19 R J rj248...@hotmail.com:
What are some simple functions that would naturally have the following type
signatures:
f :: (Integer - Integer) - Integer
I can only think of one solution to this but it doesn't guarantee that
it returns a value...
2010/5/19 Miguel Mitrofanov miguelim...@yandex.ru:
On 19 May 2010, at 08:35, Ivan Miljenovic wrote:
2010/5/19 R J rj248...@hotmail.com:
What are some simple functions that would naturally have the following
type
signatures:
f :: (Integer - Integer) - Integer
I can only think of one
On 17 May 2010 12:56, Abby Henríquez Tejera parad...@gmail.com wrote:
I'm a Haskell newbie and there's a bit of Haskell code that I don't
understand how it works. In the prelude, defining the class Show, the
function showList is implemented twice, one for String and another one
for other
On 13 May 2010 17:09, Heinrich Apfelmus apfel...@quantentunnel.de wrote:
Ah, ok, you want graphs that only work with one node type. If there is
at most one such graph for each node type, you could make a data type
family and retain the parameter, though
data family Graph node :: * - *
On 13 May 2010 18:14, Henning Thielemann
schlepp...@henning-thielemann.de wrote:
Heinrich Apfelmus schrieb:
Yes, the integers are just indexes. Of course, the example with the even
integers is a bit silly;
... might be useful for bipartite graphs
So, a K_{0,n} bipartite graph? :p
--
Ivan
On 13 May 2010 04:12, Brent Yorgey byor...@seas.upenn.edu wrote:
* Demand More of Your Automata by Aran Donohue
Great, because of Aran I now can't change some of the bits of API in
graphviz without making the code examples in his article break...
--
Ivan Lazar Miljenovic
On 11 May 2010 00:08, Henning Thielemann lemm...@henning-thielemann.de 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
On 11 May 2010 00:22, Henning Thielemann lemm...@henning-thielemann.de 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
On 11 May 2010 00:16, Henning Thielemann lemm...@henning-thielemann.de wrote:
On Tue, 11 May 2010, Ivan Lazar Miljenovic wrote:
Henning Thielemann lemm...@henning-thielemann.de writes:
I do not see why there is the need for any type extension, at
all. Consider cabal-sort, a very basic
Does ghc-pkg check complain?
Is the version of GHC being used the same one that was used to build
xmonad-contrib?
What does ghc-pkg field xmonad-contrib exposed-modules | grep LayoutHints say?
On 10 May 2010 14:59, zaxis z_a...@163.com wrote:
%pacman -Q|grep xmonad
xmonad 0.9.1-4
(Note that this really should be on the xmonad mailing list, but anyway...).
On 10 May 2010 15:09, zaxis z_a...@163.com wrote:
There is no any complain by ghc-pkg.
%ghc-pkg field xmonad-contrib exposed-modules | grep LayoutHints
XMonad.Layout.LayoutCombinators
I suggest you either go on #xmonad and ask the people there, or send
an email to the xmonad mailing list with your config attached.
On 10 May 2010 15:37, zaxis z_a...@163.com wrote:
%rm ~/.xmonad/xmonad.{hi,o}
%ls ~/.xmonad
history xmonad-i386-linux* xmonad.errors xmonad.hs
%xmonad
On 7 May 2010 12:12, Felipe Lessa felipe.le...@gmail.com wrote:
On Thu, May 06, 2010 at 09:30:50PM +0300, Sergei Trofimovich wrote:
/me wonders if Miss lambdabot might like to have such functionality.
What do you think?
Do the terms of use of Google Translate allow it?
I can't see any reason
On 6 May 2010 02:17, Leonel Fonseca leone...@gmail.com wrote:
Is it reasonable to add deriving Typeable to newtype Q?
With GeneralizedNewtypeDeriving you mean? If so, then I don't see why
it would be a problem.
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.wordpress.com
Well, based on what you want your priorites to be, I might bow out
then (at least until you start wanting to have graph-centric
operations in there, then I might pitch in).
On 6 May 2010 04:23, Alp Mestanogullari a...@mestan.fr wrote:
We also have patch-tag project
:
On 6 May 2010 04:18, Pierre-Etienne Meunier
pierreetienne.meun...@gmail.com wrote:
By the way, if someone on this list has got too much time, he could write
something that would fulfill the goals of literate programming -- à la web
and cweb.
Knuth was able to make books with his source code. I
On 6 May 2010 08:25, Gregory Crosswhite gcr...@phys.washington.edu wrote:
On May 5, 2010, at 3:09 PM, Daniel Fischer wrote:
Learning Lisp dialects is much harder (to a large part because of the
parentheses, which makes them near impossible to parse).
On the contrary, the whole point of
2010/5/6 Günther Schmidt gue.schm...@web.de:
I'm switching from darcs to mercurial with some of my projects.
Out of curiosity, why?
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.wordpress.com
___
Haskell-Cafe mailing list
On 6 May 2010 11:17, Alp Mestanogullari a...@mestan.fr wrote:
On Thu, May 6, 2010 at 2:19 AM, Ivan Miljenovic ivan.miljeno...@gmail.com
wrote:
Well, based on what you want your priorites to be, I might bow out
then (at least until you start wanting to have graph-centric
operations
Re-CC'ing -cafe:
On 6 May 2010 12:54, Leonel Fonseca leone...@gmail.com wrote:
I wasn't aware of GeneralizedNewtypeDeriving.
I just edited the source file Language.Haskell.TH.Syntax
and left:
newtype Q a = Q { unQ :: forall m. Quasi m = m a }
deriving Typeable
Hang on, is Q something
On 6 May 2010 13:25, Bill Atkins watk...@alum.rpi.edu wrote:
In order to run apps built with wxHaskell on OS X, you're supposed to wrap
the binary using a script called macosx-app
(http://www.haskell.org/haskellwiki/WxHaskell/MacOS_X).
Unfortunately, after running cabal install wx this file is
On 6 May 2010 15:01, bri...@aracnet.com wrote:
I was doing the following:
do status - mapM PF.getFileStatus filenames
let times = map PF.modificationTime status
let sorted = sortBy (\(_, t1) (_,t2) - compare t1 t2) (zip filenames times)
times - mapM (liftM PF.modificationTime .
On 6 May 2010 15:20, bri...@aracnet.com wrote:
well now it's obvious :-) I did have liftM in there, but just couldn't
quite figure out how to tie things together.
to be completely clear : liftM takes modificationTime from
Status - EpochTime
to
IO Status - IO EpochTime
You can see it
On 5 May 2010 08:29, Flavio Botelho fezsent...@gmail.com wrote:
A Windows prompt shows problems (Application not properly initialized)
with a perl.exe program.
Does cabal use perl (that's completely unexpected for me)?
GHC does if you use -fvia-C (which is not the default even on Windows
On 5 May 2010 12:04, Maciej Piechotka uzytkown...@gmail.com wrote:
1. I downloaded happstack-utile[1]
2. Edited cabal file
3. Installed it successfully linking with parsec 3.1
4. I tried to run cabal install happstack --constraint 'parsec = 3'
5. It complains that happstack-utile needs to be
On 4 May 2010 11:59, Alp Mestanogullari a...@mestan.fr wrote:
I found that idea to be great but did not see any actual effort around this.
So, I'm now thinking again about that and even enlarging it to mathematics
AI. Thus, I would like to have an idea of the number of people interested in
On 4 May 2010 04:21, Maciej Piechotka uzytkown...@gmail.com wrote:
Does anyone have installer for gtk2hs for Haskell Platform 2010.1.0.0?
Considering that there is as yet no release of gtk2hs that supports
GHC-6.12.*, it seems unlikely. At best someone may have taken a
snapshot of the darcs
1 - 100 of 214 matches
Mail list logo
