Speaking of Stackless Python, its homepage (http://www.stackless.com/)
has a rather nice layout... maybe slightly less emphasis on the About
section, but there you've got the links, the info and the news all on
the one page.
___
Haskell-Cafe mailing list
On 06/12/2007, Tim Chevalier [EMAIL PROTECTED] wrote:
This is very well-trodden ground, but if you familiarize yourself with
the literature on the subject, then who knows, you may discover
something new. And you can take pleasure in knowing that you've
already independently conceived of an
This isn't strictly Haskell related, but anyway.
Next year I will be doing my honours in mathematics. One possible
topic for my thesis that I've thought of - and my supervisor is quite
enthused about - is to use graph theory to analyse various textual
sources, starting with source code but
On 07/12/2007, Tommy McGuire [EMAIL PROTECTED] wrote:
How I envisage it happening is that a parser would be used to find all
functions in the given code, treat these as nodes in the graph and
then use directed edges to indicate which functions call other
functions. This resultant graph
On 07/12/2007, Tommy McGuire [EMAIL PROTECTED] wrote:
I was actually thinking that something like that would be more valuable
for a language like C, where types are not represented in the control flow.
By the way, in a completely different context I just ran across a couple
of references:
On 10 March 2010 11:25, zaxis z_a...@163.com wrote:
So if the local variable can be changed, then we can use loop, etc. same as
imperative languages. For example, for (i=0; i100; i++) where `i` is a
local variable in function.
But why would we want to? That's what folds, etc. are for!
--
On 10 March 2010 16:45, zaxis z_a...@163.com wrote:
Yes, we can imitate all of it (such as `when`, `until` and `for`) because
haskell is a good DSL language.
However, i feel it will be more convenient if the language itself supports
all these fundations.
You seem to be missing the point of
On 11 March 2010 09:14, David Place d...@vidplace.com wrote:
$ cabal install wx
Resolving dependencies...
cabal: cannot configure containers-0.3.0.0. It requires base =4.2 6
For the dependency on base =4.2 6 there are these packages: base-4.2.0.0.
However none of them are available.
Would other Australians be interested in having our own Hackathon (why
should all those northerners have all the fun)? I'm thinking about
organising it to be in the July break between university semesters.
There was a previous consideration a few years back to have an
OzHaskell group
OK, so we have a fair number of people indicating interest... so which
weekend would be preferred?
26/27 June
3/4 July
10/11 July
17/18 July
Or should we take this to the wiki rather than the mailing list?
On 16 March 2010 16:28, Ivan Miljenovic ivan.miljeno...@gmail.com wrote:
Would other
On 18 March 2010 15:07, Warren Harris warrensomeb...@gmail.com wrote:
Apologies in advance if this is all documented somewhere, but I couldn't
find it on the haskell platform site/trac. BTW, I'm on Mac/Leopard -- love
the fact that it didn't take hours to build everything!
I have no real
Hint: look at the type of flip...
Also, there's a haskell-beginners mailing list. You may wish to post
there rather than asking us every question you get whilst learning
Haskell.
On 19 March 2010 14:34, zaxis z_a...@163.com wrote:
let f x xs = [x:xs,xs]
:t f
f :: a - [a] - [[a]]
:t (=) .f
On 22 March 2010 08:33, Brandon S. Allbery KF8NH allb...@ece.cmu.edu wrote:
On Mar 21, 2010, at 17:31 , Ivan Lazar Miljenovic wrote:
I'm sorry, but is there a question in there?
H. h._h._...@hotmail.com writes:
(7e-3 :: BigFloat Prec50) (6e-4 :: BigFloat Prec50)
False
0.007 0.0006?
Oh,
On 22 March 2010 10:57, Bernie Pope florbit...@gmail.com wrote:
Do you have minumum requirements for GHC? I tried to 'cabal install
salvia-demo', but with no luck:
Looking at the dependencies listed, they claim that GHC should work
with = 6.10.1.
cabal install salvia-demo
Resolving
On 22 March 2010 13:49, adamtheturtle kill2thr...@hotmail.com wrote:
Just tried the code
shuffle :: Int - [a] - [a]
shuffle i [] = []
shuffle i cards = [(cards!!i) : shuffle (fst pair) (delete (cards!!i)
cards)]
where pair = randomR (0, 51) (mkStdGen 42)
and I get:
Could not
Since my answer before to your question obviously wasn't clear enough,
let me highlight the lines of the error message that summarise what
you have to do:
On 22 March 2010 14:31, adamtheturtle kill2thr...@hotmail.com wrote:
Possible fix:
add (Eq a) to the context of the type signature
On 22 March 2010 14:52, adamtheturtle kill2thr...@hotmail.com wrote:
So sorry to keep on going on about this but I have been set to start with
shuffle :: Int - [a] - [a] so I have to do that and can't use the given
code
and I
really don't know where to put (Eq a)
First of all, do a tutorial
On 23 March 2010 00:10, Johan Tibell johan.tib...@gmail.com wrote:
A sequence of bytes is not the same thing as a sequence of Unicode
code points. If you want to replace String by something more efficient
have a look at Data.Text.
Though Data.Text still has the disadvantage of not being as
On 23 March 2010 10:02, Dupont Corentin corentin.dup...@gmail.com wrote:
I’m relatively new to Haskell.
Welcome!
I’m wondering if it exist a tool to graphically represent Haskell code.
Look at the little graphics at: http://www.haskell.org/arrows/index.html (and
following pages) from Ross
On 23 March 2010 14:25, wren ng thornton w...@freegeek.org wrote:
w...@semiramis:~ $ ls /usr/local
ls: /usr/local: No such file or directory
w...@semiramis:~ $ ls /usr/bin/cabal
ls: /usr/bin/cabal: No such file or directory
But http://hackage.haskell.org/platform/new/contents.html tells me
On 23 March 2010 16:57, Don Stewart d...@galois.com wrote:
2010.1.0.0 is definited as a 'beta' for 2010.2
http://trac.haskell.org/haskell-platform/wiki/VersionNumbers
Oh, so you do the odd/even beta/stable release versioning in
conjunction with the PVP?
--
Ivan Lazar Miljenovic
On 24 March 2010 15:46, 国平张 zhangguop...@gmail.com wrote:
I wrote a type program to compute fibonacci series, if the max value
is big, then it becomes very slow.
What does this have to do with Pom's problem?
http://tinyurl.com/ya3vvye
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
On 24 March 2010 16:26, Ben Derrett ben.derr...@googlemail.com wrote:
cabal install cgi
Resolving dependencies...
Configuring MonadCatchIO-mtl-0.3.0.0...
Preprocessing library MonadCatchIO-mtl-0.3.0.0...
Building MonadCatchIO-mtl-0.3.0.0...
[1 of 1] Compiling Control.Monad.CatchIO (
On 24 March 2010 16:52, Ben Derrett ben.derr...@googlemail.com wrote:
Thank you. I'm using GHC 6.8.2.
That shouldn't be a problem Unless, of course, that syntax (it's
using \e::E.SomeException) is valid in GHC = 6.10 but not previously
(in which case I would think that that's a bug).
I
On 25 March 2010 12:21, Bernie Pope florbit...@gmail.com wrote:
Yes, I tried that, but unfortunately it falls over with:
Language/Haskell/TH/Quote.hs:31:12:
Not in scope: data constructor `CharConstr'
cabal: Error: some packages failed to install:
template-haskell-2.4.0.0 failed during
On 26 March 2010 13:11, Maciej Piechotka uzytkown...@gmail.com wrote:
Earlier version of patch I tried to sent to maintainer of zlib. However
I received no response.
Probably because Duncan is (apparently) a very busy man: working,
hacking, finishing off his thesis, etc.
--
Ivan Lazar
On 29 March 2010 11:11, Jeremy Shaw jer...@n-heptane.com wrote:
We should not simply make the unit tests be a compile time flag in the
.cabal, because there is no way for the happstack parent package to depend
on the version of happstack-data (for example) which has the unit tests
enable.
On 29 March 2010 13:13, Duane Johnson duane.john...@gmail.com wrote:
How can I parameterize the type of the following data class so that any type
can be a Candidate?
data Poll = Poll [Candidate] [Ballot]
data Poll a = Poll [a] [Ballot]
data Poll = Poll [a] [Ballot]
So close...
--
2010/3/30 Don Stewart d...@galois.com:
I notice that posts from the Haskell elders are pretty rare now. Only
every now and then we hear from them.
How come?
Because there is too much noise on this list, Günther
And they have better things to do than answer stupid questions and get
involved
On 30 March 2010 13:27, wagne...@seas.upenn.edu wrote:
The Haskell Platform is supposed to be a development environment...
No-one ever said it was a _complete_ development environment and that
you'd never need any other libraries, tools, etc.
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
On 30 March 2010 13:55, Jason Dagit da...@codersbase.com wrote:
The reason I started telling everyone to avoid GHC in apt was the way it was
packaged. Casual Haskell users would install GHC but get something like
1/10th of the libraries GHC installs when you do a source install
Is that
On 30 March 2010 14:33, Erik de Castro Lopo mle...@mega-nerd.com wrote:
The haskell packages for Debian (I am one)
You are a Haskell _package_? :p
- The source code package will be called haskell-foo.
Is this an actual installable package (so you're installing the actual
source code?) ?
I use the dreaded unsafePerformIO for a few functions in my graphviz
library (
http://hackage.haskell.org/packages/archive/graphviz/2999.8.0.0/doc/html/src/Data-GraphViz.html
). However, a few months ago someone informed me that the
documentation for unsafePerformIO had some steps that should be
Sorry for the duplicate email Lee, but I somehow forgot to CC the
mailing list :s
On 31 March 2010 13:12, Lee Pike leep...@gmail.com wrote:
I'd like it if there were a Data.Graph in the base libraries with basic
graph-theoretic operations. Is this something that's been discussed?
I'm kinda
On 1 April 2010 11:05, Patrick LeBoutillier
patrick.leboutill...@gmail.com wrote:
Basically I'm looking for a bit of feedback/info:
- Does anyone know if there are already similar projets out there?
On Hackage: LambdaShell, language-sh, HSH, Hashell (dead), only, Shellac
Note that not all of
On 1 April 2010 11:42, Alex Rozenshteyn rpglove...@gmail.com wrote:
Main.hs:11:7:
Could not find module `System.Posix.Signals':
It is a member of the hidden package `unix-2.4.0.0'.
Perhaps you need to add `unix' to the build-depends in your .cabal
file.
Interesting, because
On 5 April 2010 07:28, David House dmho...@gmail.com wrote:
An issue came up on #haskell recently with Hackage accounts requiring
real names. The person in question (who didn't send this email as he's
wishing to remain anonymous) applied for a Hackage account and was
turned down, as he refused
On 6 April 2010 10:48, Christopher Done chrisd...@googlemail.com wrote:
This discussion makes me ponder whether someone like _why the lucky
stiff would ever contribute Haskell packages, hehe.
I think we can do without someone who hides behind anonymity and then
suddenly decides to go and delete
2010/4/6 Günther Schmidt gue.schm...@web.de:
I initially start with Strings, ie. [Char], but there is no function to
convert the 2 back and forth. There is however a function which takes
[Word8] to BytesString and back.
The problem is one of encoding. If you use the Char8 Bytestring
variants,
On 6 April 2010 13:24, Simon Michael si...@joyful.com wrote:
On 4/2/10 5:28 AM, Thomas Schilling wrote:
How about something more colourful?
http://i.imgur.com/7jCPq.png
No-one replied to this, but I like it. You sacrificed some information
density for a simple, engaging, low-stress page
On 6 April 2010 14:28, Ertugrul Soeylemez e...@ertes.de wrote:
Luke Palmer lrpal...@gmail.com wrote:
When you say convincing, you are talking about yourself being
convinced, right? So this paragraph means The arguments against my
position haven't convinced me, but the arguments for my
On 6 April 2010 15:52, Edward Z. Yang ezy...@mit.edu wrote:
This is a pretty terrible reason, but I'm going to throw it out there:
I like real names because they're much more aesthetically pleasing. In
my younger days, I once decided, Hey, I should get a pseudonym and I
picked something
On 7 April 2010 08:40, Thomas Schilling nomin...@googlemail.com wrote:
On 6 April 2010 22:39, Ivan Lazar Miljenovic ivan.miljeno...@gmail.com
wrote:
I like the layout, but hate the colour scheme.
Wow, hate is a very strong word.
OK, I dislike the colour scheme. Happy now? ;-)
--
Ivan
On 7 April 2010 10:02, Thomas Schilling nomin...@googlemail.com wrote:
On 7 April 2010 00:57, Ivan Miljenovic ivan.miljeno...@gmail.com wrote:
OK, I dislike the colour scheme. Happy now? ;-)
That's still not constructive. I.e, is it the black, the gray, the orange?
OK, it's the black
On 7 April 2010 10:28, Thomas Tuegel ttue...@gmail.com wrote:
Ok, this is the bottom-line that I didn't understand after our first
exchange, but I think now I do: I should entirely scrap the second
aspect of my proposal and focus exclusively on making Cabal build and
run test programs.
Just
On 7 April 2010 10:45, Gregory Crosswhite gcr...@phys.washington.edu wrote:
Yes, I personally think that tests which are automatically run should be
self-contained so that they require no additional intervention by the user.
However, one could conceivably flag some tests as being manual so
On 7 April 2010 10:49, Thomas Schilling nomin...@googlemail.com wrote:
http://i.imgur.com/cumLj.png
I wonder... is there any reason why the actual page content is so
narrow compared to the title bar (to allow for small screens)?
[snip] So headings are now a very dark blue.
The italic things
On 7 April 2010 11:53, Ben Millwood hask...@benmachine.co.uk wrote:
I've never really trusted this argument - it's not required that the
browser window occupy the entire screen, so why not let the user
choose how wide they want their text?
Agreed; I hate websites/blogs/etc. that only take up a
On 7 April 2010 16:41, Uwe Schmidt s...@fh-wedel.de wrote:
But currently it's assumed, that getXPathTreesWithNsEnv is used only in an
innocent way.
I like your phrasing here... I might steal it for graphviz rather than
just saying it's assumed that you don't do such-and-such :p
--
Ivan Lazar
On 8 April 2010 08:25, Daniel Fischer daniel.is.fisc...@web.de wrote:
Am Donnerstag 08 April 2010 00:09:34 schrieb Ivan Lazar Miljenovic:
etc. ...
Such as?
To avoid stating these all over again:
http://ivanmiljenovic.wordpress.com/2010/03/15/repeat-after-me-cabal-is-not-a-package-manager/
On 8 April 2010 10:41, Daniel Fischer daniel.is.fisc...@web.de wrote:
However, I wanted to know what the etc stood for, with taking care of
dependencies and uninstalling already mentioned. Upgrading, yes, but what
else?
Patching, bug fixing, stuff like that.
--
Ivan Lazar Miljenovic
On 8 April 2010 16:29, Ketil Malde ke...@malde.org wrote:
Support, in the sense that somebody is actually responsible for the
package? (Unlike Hackage, where some packages have a
closed-for-nonsubscribers mailing list as 'maintainer'.)
Which packages are these? I don't recall seeing any with
On 10 April 2010 00:20, Neil Brown nc...@kent.ac.uk wrote:
The comments in that bug report actually mention My patch does not warn on
uses of , only in do-notation, where the situation is more clear cut. I
take to be an explicit sign that the user wants to ignore the result of
the first
On 10 April 2010 02:07, Bryan O'Sullivan b...@serpentine.com wrote:
Personally, I find it to be tremendously noisy and unhelpful, and I always
edit my .cabal files to turn it off. I think of it as a usability
regression.
Yeah, I'm very tempted to do this as well. This warning might make
sense
On 13 April 2010 20:02, Ozgur Akgun ozgurak...@gmail.com wrote:
func1 :: T - T
func1 A = B
func1Fixed :: T - Maybe T
func1Fixed A = Just B
func1Fixed _ = Nothing
Why not use Maybe for func1 in the first place? Or are you wanting to
automagically make all uses of head, tail, etc. safe?
--
On 14 April 2010 16:03, Ashley Yakeley ash...@semantic.org wrote:
Why isn't there an instance Eq (a - b) ?
How do you prove that f = (2*) and g x = x + x are equal?
Mathematically, you can; but the only way you can prove it in
Haskell is by comparing the values for the entire domain (which gets
On 16 April 2010 15:59, zaxis z_a...@163.com wrote:
instance (BinaryDefer a, BinaryDefer b) = BinaryDefer (a,b) where
put (a,b) = put2 a b
get = get2 (,)
size x = let ~(a,b) = x in size a + size b
putFixed (a,b) = putFixed2 a b
getFixed = getFixed2 (,)
in `size` function,
On 19 April 2010 06:06, Daniel Fischer daniel.is.fisc...@web.de wrote:
If wxHaskell could be installed with one cabal command that would be
incredibly cool :-)
Well, it's just one cabal command if you have all non-Haskell requirements
installed as needed.
Exactly; it's unreasonable to
Can the owner of
c10b66c97b5cd09384aa9f82ecd95...@orangeat.blackberry.com please fix
their emails up (or the haskell-cafe admins remove that address), as I
keep getting delivery status notification failure messages over a week
after I send an email to the list (I would have emailed that address
A few things I forgot to mention in my haste to get this out:
1) I was planning on having a tutorial-style blog post where I'd use
graphviz to parse an manipulate the output ghc-pkg dot; however I've
been busier than I expected recently and figured it'd be better to get
this release out and do
On 27 April 2010 03:39, Louis Wasserman wasserman.lo...@gmail.com wrote:
I'm a fan of making FGL more record-based, but definitely keeping the
inductive graph style.
Definitely.
My own biggest gripe with previous versions of FGL was that the graph
implementations were severely
On 27 April 2010 05:43, Zura_ x...@gol.ge wrote:
Is it possible to run haskell program in emacs without typing main in the
ghci buffer? Assuming main function exists of course.
Or, maybe automate sending main\n string to ghci buffer input.
In other words, I want edit/run/see result style
On 27 April 2010 02:15, Ozgur Akgun ozgurak...@gmail.com wrote:
data Expr = Num Int | Expr :+: Expr | Expr :-: Expr
[snip]
-- | If the input is 'Num' does magic, if it is ':+:' does even more magic!
someFunc :: Expr - Expr
In the output of this markup, the 'Num' is hyperlinked but the
On 27 April 2010 10:08, Joe Fredette jfred...@gmail.com wrote:
I hope to get HWN out shortly after it's all finished up. I shall return!
As long as you don't end up copying the Gentoo situation where the
Gentoo Weekly News died, was resurrected (not sure how many times),
was converted to the
On 27 April 2010 14:55, Aaron Denney wno...@ofb.net wrote:
I despair that a better Numeric hierarchy will never make it into
Haskell.
I think the reason it hasn't is because I for one still haven't seen a
fully implemented such hierarchy that's worth using.
Then again, most of my numerical
On 28 April 2010 08:48, Henning Thielemann
schlepp...@henning-thielemann.de wrote:
Ivan Lazar Miljenovic schrieb:
Henning Thielemann schlepp...@henning-thielemann.de writes:
I was not happy with the way FGL handles lables so far:
On 28 April 2010 10:17, zaxis z_a...@163.com wrote:
newtype TypeMap = TypeMap (Map.Map TypeRep Dynamic)
lookup :: Typeable a = TypeMap - Maybe a
lookup (TypeMap mp) = res
where res = liftM (fromJust . fromDynamic) $ Map.lookup (typeOf $
fromJust res) mp
It seems that the `res` in
On 28 April 2010 11:22, Bradford Larsen brad.lar...@gmail.com wrote:
Could you elaborate on what you mean regarding the mtl approach
design? What makes them bad?
Neil seems to have summed up the detractors opinions of mtl quite well
at
Sorry for the useless noise, I realised just after I sent this that
that is what Jason said initially :s
On 1 May 2010 17:02, Ivan Lazar Miljenovic ivan.miljeno...@gmail.com wrote:
Brandon S. Allbery KF8NH allb...@ece.cmu.edu writes:
On May 1, 2010, at 02:38 , Jason Dagit wrote:
Why wasn't
On 3 May 2010 10:25, Daniel Fischer daniel.is.fisc...@web.de wrote:
It is by my bash:
da...@linux-mkk1:~/Haskell export DUMMY=~/bin:~/.cabal
da...@linux-mkk1:~/Haskell echo $DUMMY
/home/dafis/bin:/home/dafis/.cabal
da...@linux-mkk1:~/Haskell printenv DUMMY
/home/dafis/bin:/home/dafis/.cabal
On 3 May 2010 10:37, Brandon S. Allbery KF8NH allb...@ece.cmu.edu wrote:
On May 2, 2010, at 20:34 , Ivan Miljenovic wrote:
iv...@feitpc02 ~ $export DUMMY=~/bin:~/cabal
All bets are off when it's quoted; no shell tilde-expands quoted strings.
Oh, in that case without the quotes it works (I
On 3 May 2010 11:18, Edgar Z. Alvarenga ed...@ymonad.com wrote:
On Sun, 02/May/2010 at 13:10 -0700, Don Stewart wrote:
* Avoid partial functions
Why?
What does head [] do again?
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.wordpress.com
On 3 May 2010 14:17, aditya siram aditya.si...@gmail.com wrote:
I'm a little confused about this too. I've seen many functions defined like:
f x = (\s - ...)
which is a partial function because it returns a function and is the same as:
f x s = ...
No, that's a partially applied function.
A
On 3 May 2010 14:35, Alexander Dunlap alexander.dun...@gmail.com wrote:
Of course, there are situations where it is really awkward to not use
partial functions, basically because you *know* that an invariant is
satisfied and there is no sane course of action if it isn't.
True, like map head .
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
On 4 May 2010 13:30, Luke Palmer lrpal...@gmail.com wrote:
Here is a contrived example of what I am referring to:
prefac f 0 = 1
prefac f n = n * f (n-1)
fac = (\x - x x) (\x - prefac (x x))
I can't work out how this works (or should work rather); is it meant
to be using church numerals or
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 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 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
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 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
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 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
1 - 100 of 214 matches
Mail list logo
