Ivan Lazar Miljenovic schrieb:
- Having a separate parameter (using associated types?) for the node
type rather than just using Int.
Just Int for nodes was disappointing. It should have been at least a
newtype. I would vote against these experimental features like
associated types or
Christian Maeder christian.mae...@dfki.de writes:
Ivan Lazar Miljenovic schrieb:
- Having a separate parameter (using associated types?) for the node
type rather than just using Int.
Just Int for nodes was disappointing. It should have been at least a
newtype.
This then loses
Hi,
Primarily I want to see in FGL: documentation, documentation and more
documentation. The library has lots of undocumented functions
(especially the queries, e.g.
http://hackage.haskell.org/packages/archive/fgl/5.4.2.2/doc/html/Data-Graph-Inductive-Query-DFS.html
has no documentation at
Ivan Lazar Miljenovic schrieb:
I would vote against these experimental features like associated types
or MPTC and FD. I prefer plain type parameters for data types, but
that does not fit well together with type classes.
Why don't you like extensions? I used to feel the same way, but then
Hi - I'm looking for an example/demo happstack server
that handles SOAP requests. - Thanks, J.W.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello Ivan
What would your thoughts be on freezing FGL as it is and putting
changes into a new package FGL2 or NewFGL?
The implementation technique for FGL is independently interesting;
Martin Erwig expanded on it in other papers ('Metamorphic
Programming') but no one else seems to have picked
From: sefer@gmail.com [mailto:sefer@gmail.com] On
Behalf Of Yitzchak Gale
On Fri, Apr 23, 2010 at 1:24 PM, Bayley, Alistair wrote:
Looks like the London HUG domain (londonhug.net) registration has
expired. Neil Bartlett was the registrant.
Neil: do you plan to renew?
The
To reproduce:
1) Look for data IO on Hoogle, e.g.
http://haskell.org/ghc/docs/6.12.1/html/libraries/base-4.2.0.0/Prelude.html#t%3AIO
2) Click source, which redirects to
http://haskell.org/ghc/docs/6.12.1/html/libraries/base-4.2.0.0/src/GHC-Types.html#IO
3) Observe a Not Found page
Is there
Hi list,
how would you describe Ada's ranges in Haskell's typesystem?
http://en.wikibooks.org/wiki/Ada_Programming/Types/range
I feel, you can not because this is a runtime property.
Bye,
Lenny___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Dear all,
Why does cabal seem to prefer base-3.0.3.2 over base-4.2.0.0 when
installing packages with an unqualified base requirement? Example:
$ cabal install -v fad --reinstall
[snip]
Resolving dependencies...
selecting fad-1.0 (hackage)
selecting base-3.0.3.2 (installed) and 4.2.0.0
Actually, the behavior of openFile when given a String with characters
0xFF is also completely undocumented. I am not sure what it does with
that. It should probably be the same as runCommand, whatever it is.
Actually, the behaviour of openFile is known to be platform-dependent.
Stephen Tetley stephen.tet...@gmail.com writes:
What would your thoughts be on freezing FGL as it is and putting
changes into a new package FGL2 or NewFGL?
That's another possibility. However, I was planning on keeping the
fundamental layout and design of FGL. I quite like and have used the
So, the problem is that there are broken links _in Hoogle_; have you
thought about contacting the author Neil Mitchell directly?
hask...@kudling.de hask...@kudling.de writes:
To reproduce:
1) Look for data IO on Hoogle, e.g.
Bjorn Buckwalter bjorn.buckwal...@gmail.com writes:
Why does cabal seem to prefer base-3.0.3.2 over base-4.2.0.0 when
installing packages with an unqualified base requirement? Example:
You mean cabal-install rather than Cabal. The reason that base-3 is
chosen is because many of these old
On 04/26/2010 12:50 PM, hask...@kudling.de wrote:
Hi list,
how would you describe Ada's ranges in Haskell's typesystem?
http://en.wikibooks.org/wiki/Ada_Programming/Types/range
Hi Lenny,
can non-constant expressions be given as arguments to 'range'? If not, then
what about a
FYI
-- Ursprüngliche Nachricht --
Von: hask...@kudling.de hask...@kudling.de
An: Ivan Lazar Miljenovic ivan.miljeno...@gmail.com
Cc: Neil Mitchell ndmitch...@gmail.com
Datum: 26. April 2010 um 13:45
Betreff: Re: [Haskell-cafe] Broken ghc documentation links
Hi,
So, the
On Mon, Apr 26, 2010 at 19:38, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Bjorn Buckwalter bjorn.buckwal...@gmail.com writes:
Why does cabal seem to prefer base-3.0.3.2 over base-4.2.0.0 when
installing packages with an unqualified base requirement? Example:
You mean cabal-install
Am Montag 26 April 2010 13:36:22 schrieb Ivan Lazar Miljenovic:
So, the problem is that there are broken links _in Hoogle_;
No, hoogle just sends you to
http://www.haskell.org/ghc/docs/6.12.2/html/libraries/base-4.2.0.1/Prelude.html#t%3AIO
, which does exist. It's the 'Source' link in the
Bjorn Buckwalter bjorn.buckwal...@gmail.com writes:
On Mon, Apr 26, 2010 at 19:38, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Bjorn Buckwalter bjorn.buckwal...@gmail.com writes:
Why does cabal seem to prefer base-3.0.3.2 over base-4.2.0.0 when
installing packages with an
Dear all,
Does it make good sense that 'and []' returns 'True' and 'or []'
returns 'False'? The Haskell Road to Logic, Maths and Programming says
so:
The function or takes a list of truth values and returns True if at
least one member of the list equals True, while and takes a list of
truth
Bjorn Buckwalter wrote:
Dear all,
Does it make good sense that 'and []' returns 'True' and 'or []'
returns 'False'? The Haskell Road to Logic, Maths and Programming says
so:
The function or takes a list of truth values and returns True if at
least one member of the list equals True,
Well, what's the sum of an empty list? Seems naturally that it's 0, but why?
Let's say that sum [] = x.
If we take two lists, say, l1 = [1,2,3] and l2 = [4,5], then
sum l1 + sum l2 = 6 + 9 = 15 = sum [1,2,3,4,5] = sum (l1 ++ l2)
We expect it to be the case even if one of the lists is empty,
Am Montag 26 April 2010 14:15:40 schrieb Bjorn Buckwalter:
Dear all,
Does it make good sense that 'and []' returns 'True' and 'or []'
returns 'False'? The Haskell Road to Logic, Maths and Programming says
so:
The function or takes a list of truth values and returns True if at
least one
On Mon, Apr 26, 2010 at 20:07, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Bjorn Buckwalter bjorn.buckwal...@gmail.com writes:
On Mon, Apr 26, 2010 at 19:38, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Bjorn Buckwalter bjorn.buckwal...@gmail.com writes:
Why does cabal
Forgot about this one:
Bjorn Buckwalter wrote:
What got me thinking about this was the apparently incorrect intuition
that 'and xs' would imply 'or xs'.
No. See, and is very close to for all, and or is similarly close to exists. For example, the statement all crows are black means just this
Am Montag 26 April 2010 14:32:03 schrieb Bjorn Buckwalter:
So what would be the fix, to set an upper bound on base? Is the
general recommendation that all packages should specify upper bounds
on all dependencies (if so why doesn't Cabal tell us?)?
Yes, that's the general recommendation.
Bjorn Buckwalter bjorn.buckwal...@gmail.com writes:
So what would be the fix, to set an upper bound on base?
The fix is to have the maintainer check whether or not the package
builds with base-4 (you can do this the old manual way using runhaskell
Setup.hs). If it does, then specify that it
Bjorn Buckwalter wrote:
Dear all,
Does it make good sense that 'and []' returns 'True' and 'or []'
returns 'False'?
It's certainly what I would expect it to do, based on several ways of
thinking.
1: If we define the function using explicit recursion:
and (x:xs) = x and xs
Therefore and []
Ok Guys, you've convinced me thrice within ten minutes of posing my
question. The quality of the mailing list is just ridiculous! ;)
And Miguel, thanks for the follow-up regarding for all and exists
– it's an excellent analogy and easy to remember!
On Mon, Apr 26, 2010 at 20:23, Jochem Berndsen
Daniel Fischer daniel.is.fisc...@web.de writes:
Am Montag 26 April 2010 13:36:22 schrieb Ivan Lazar Miljenovic:
So, the problem is that there are broken links _in Hoogle_;
No, hoogle just sends you to
http://www.haskell.org/ghc/docs/6.12.2/html/libraries/base-4.2.0.1/Prelude.html#t%3AIO
,
Hello,
has anyone yet managed to install ghc (6.10.4) into an OpenSolaris zone?
Günther
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 04/25/2010 03:47 PM, Ivan Lazar Miljenovic wrote:
So you recommend having packages specifically for instances?
My main problem with this is if you want a custom variant of that
instance. Let's take FGL graphs for example with instances for
QuickCheck's Arbitrary class. Maybe you want
I'm pleased to announce the latest version of my graphviz library that
provides Haskell bindings to the Graphviz graph visualisation suite.
There are numerous changes in this release, the most important of which
are:
* graphviz now has an FAQ and an improved README as well as its own
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
Hi,
is there a mailing-list manager written in haskell?
Best regards
Günther
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Am Montag 26 April 2010 15:15:03 schrieb Ivan Lazar Miljenovic:
Daniel Fischer daniel.is.fisc...@web.de writes:
Am Montag 26 April 2010 13:36:22 schrieb Ivan Lazar Miljenovic:
So, the problem is that there are broken links _in Hoogle_;
No, hoogle just sends you to
Hello, I've been trying for a while to build the SDL haskell library
on windows. People have told me it worked for them, but I can't get to
work for the life of me. I have the latest Haskell Platform, I think
more or less the latest MINGW and MSYS tools. I'm on Windows 7 64
bits. I installed the
Hi Aaron,
On 21.04.2010 20:29, Aaron D. Ball wrote:
Unfortunately, Eden is one of the examples I had in mind when
referring to distributed Haskell projects as overly complicated and
[for practical purposes] dead. Their last release available for
download was in 2006. Their beta is
Hi all,
If I have the following data type:
data Expr = Num Int | Expr :+: Expr | Expr :-: Expr
Haddock handles the infix constructors, and generates a very nice output
(html in this case)
However when I try to reference to one of the infix constructors in the
markup of other functions it fails
Am Montag 26 April 2010 18:15:02 schrieb Ozgur Akgun:
Hi all,
If I have the following data type:
data Expr = Num Int | Expr :+: Expr | Expr :-: Expr
Haddock handles the infix constructors, and generates a very nice output
(html in this case)
However when I try to reference to one of the
This looks interesting: an international competition
of solvers for package/component installation and upgrade problems.
http://www.mancoosi.org/misc-2010/ (deadline: June 10)
Is the underlying package dependency model the same as cabal's?
If (nearly) so, then cabal's solver could enter the
On Apr 23, 2010, at 2:59 PM, Thomas Hartman wrote:
So, you might need to
-- upgrade hsx
-- make sure that the upgraded trhsx executable is the one being
executed by cabal install hsx (maybe deleting/temporarily moving other
trhsx exes)
Unfortunately, this suggestion didn't work out for me.
On Apr 26, 2010, at 09:33 , John Goerzen wrote:
It would, however, be nice if the language allowed you to override
default instances with the code in your own package.
Many other languages refer to this kind of thing as monkey patching
and warn against it because of the problems it causes.
I'm a fan of making FGL more record-based, but definitely keeping the
inductive graph style.
My own biggest gripe with previous versions of FGL was that the graph
implementations were severely underoptimized. In particular, PatriciaTree
left open a *lot* of optimization.
Ivan, would you like to
Hello all,
I'm having difficulties understanding rank-2 polymorphism in combination
with overloading. Consider the following contrived definition:
f :: (forall a . Eq a = a - a - Bool) - Bool
f eq = eq True True
Then, we pass f both an overloaded function and a regular polymorphic
function:
Hey,
I'm trying to do some funky things with the FFI, and I'm clueless enough
with C that I could use some help.
In particular, I'm trying to bind to the glpk library in a multithreaded
style. It's not normally thread-safe, but somebody suggested how to make it
safe here
Thomas van Noort wrote:
Hello all,
I'm having difficulties understanding rank-2 polymorphism in combination
with overloading. Consider the following contrived definition:
f :: (forall a . Eq a = a - a - Bool) - Bool
f eq = eq True True
Then, we pass f both an overloaded function and a
Am Montag 26 April 2010 19:52:23 schrieb Thomas van Noort:
Hello all,
I'm having difficulties understanding rank-2 polymorphism in combination
with overloading. Consider the following contrived definition:
f :: (forall a . Eq a = a - a - Bool) - Bool
f eq = eq True True
Then, we pass f
Hi,
The issue of a tool to help with checking packages against the Package
Versioning Policy (PVP:
http://www.haskell.org/haskellwiki/Package_versioning_policy) has come
up several times on this list, and it seems to be a generally wanted
tool. One of the things desired in such a tool is
2010/4/26 Daniel Fischer daniel.is.fisc...@web.de:
Am Montag 26 April 2010 18:15:02 schrieb Ozgur Akgun:
Hi all,
If I have the following data type:
data Expr = Num Int | Expr :+: Expr | Expr :-: Expr
Haddock handles the infix constructors, and generates a very nice output
(html in this
On 26-4-2010 20:13, Jochem Berndsen wrote:
Thomas van Noort wrote:
...
f requires a function that is able to compute, for two values of type a
(which instantiates Eq), a Boolean.
y certainly fulfills that requirement: it does not even require that the
values are of a type instantiating Eq.
On 26-4-2010 20:12, Daniel Fischer wrote:
Am Montag 26 April 2010 19:52:23 schrieb Thomas van Noort:
...
Yes, y's type is more general than the type required by f, hence y is an
acceptable argument for f - even z :: forall a b. a - b - Bool is.
That's what I thought. I've just never seen
Hello,
Does trying to install hsp-0.5.1 work any better?
- jeremy
On Apr 26, 2010, at 12:27 PM, Alexander Solla wrote:
On Apr 23, 2010, at 2:59 PM, Thomas Hartman wrote:
So, you might need to
-- upgrade hsx
-- make sure that the upgraded trhsx executable is the one being
executed by cabal
Hello,
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 session.
Thanks in advance,
Zura
--
View this
On Apr 26, 2010, at 12:30 PM, Jeremy Shaw wrote:
Does trying to install hsp-0.5.1 work any better?
I hadn't tried it, since it forces hsx-0.7 to install. But I gave it
a shot, and it fails the same way:
[ a...@kizaru:~/ ]$ cabal install hsp-0.5.1
Resolving dependencies...
Configuring
So, how can we make use of this fix?
On 26 April 2010 19:47, David Waern david.wa...@gmail.com wrote:
2010/4/26 Daniel Fischer daniel.is.fisc...@web.de:
Am Montag 26 April 2010 18:15:02 schrieb Ozgur Akgun:
Hi all,
If I have the following data type:
data Expr = Num Int | Expr :+:
Am Montag 26 April 2010 22:05:48 schrieb Ozgur Akgun:
So, how can we make use of this fix?
My guess:
$ cabal install haddock-2.7.2
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Alexander Solla a...@2piix.com writes:
On Apr 26, 2010, at 12:30 PM, Jeremy Shaw wrote:
Does trying to install hsp-0.5.1 work any better?
I hadn't tried it, since it forces hsx-0.7 to install. But I gave it a shot,
and it fails the same way:
[ a...@kizaru:~/ ]$ cabal install hsp-0.5.1
On Apr 26, 2010, at 1:23 PM, Gregory Collins wrote:
Is $HOME/.cabal/bin on your $PATH?
Argh.
I had ~/.cabal/bin in my $PATH instead of $HOME/.cabal/bin. I'm
still not sure what the semantic difference is in this use case, but
one ($HOME) works and the other (~/) doesn't.
Thanks
Am Montag 26 April 2010 22:23:42 schrieb Gregory Collins:
Alexander Solla a...@2piix.com writes:
On Apr 26, 2010, at 12:30 PM, Jeremy Shaw wrote:
Does trying to install hsp-0.5.1 work any better?
I hadn't tried it, since it forces hsx-0.7 to install. But I gave it
a shot, and it fails
2010/4/25 Patai Gergely patai_gerg...@fastmail.fm:
(in my own FRP experiments I have an update thread and a render thread).
I wonder how to nicely deal with state that requires communication with
the outer world, even though it is functional at heart. For instance, if
you want to change a
Hi all,
I haven't seen a Haskell Weekly News in a while. Is there anything I
can do to help?
-deech
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Apr 27, 2010, at 12:15 AM, Bjorn Buckwalter wrote:
Dear all,
Does it make good sense that 'and []' returns 'True' and 'or []'
returns 'False'?
YES!
There is no other behaviour that would make sense.
You wouldn't expect sum [] to return anything but 0, would you?
What got me thinking
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
Hehe,
Mostly, at the moment, as I mentioned to Deech, what is holding me
up is trying to get HWN and 7 classes worth of finals and papers done.
This is the last two weeks of my last semester, but it should be all
done soon.
I hope to get HWN out shortly after it's all finished up. I
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
Most certainly, the HWN is easy to put together, it's just a little
time consuming, the weekly schedule is just enough under a normal 40-
hour courseload. When that number jumps into the high billions (as it
did this last semester), it becomes someone more difficult to fit in.
HWN will
On 24/04/2010, at 22:42, Roman Leshchinskiy wrote:
On 24/04/2010, at 22:06, Barak A. Pearlmutter wrote:
I was thinking of this:
data T = T Double deriving ( Eq, Ord )
... GHC basically produces
instance Ord T where
compare (T x) (T y) = compare x y
t u = compare t u == LT
That
Zura_ x...@gol.ge writes:
Hello,
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 session.
Assuming
Hello,
I'm implementing a command which manipulates files both on Unix/Mac
and Windows. I was very surprised because there is not
getStatusChangeTime function. So, I wrote it with CPP.
http://github.com/kazu-yamamoto/Mew/blob/master/bin/hs/Stat.hs
Another problem is that since '\\' is
Excerpts from Kazu Yamamoto (山本和彦)'s message of Tue Apr 27 04:59:46 +0200 2010:
Hello,
I'm implementing a command which manipulates files both on Unix/Mac
and Windows. I was very surprised because there is not
getStatusChangeTime function. So, I wrote it with CPP.
Hello,
Clarify this, please. Used by who?
It is by System.FilePath.
Windows: combine home bob == home\\bob
Both Cabal and filepath libraries do have functions operating on
filepath strings. Eg filepath can split them.
I'm want to use regular expressions for results of 'combine', for
Hi Kazu,
I don't have a ghc Windows installation at the moment so I can't test.
filepath has functions such as normalise and equalFilePath.
Have a look at splitPath which is using pathSeparators which allows both
\\ and / on Windows.
filpath is using \\ to join pathes though.
So appling
On 2010-04-23, Khudyakov Alexey alexey.sklad...@gmail.com wrote:
В сообщении от 23 апреля 2010 02:36:07 Rickard Karlsson написал:
Hi,
I'm trying to download a file in UTF-8 with libcurl(1.3.5) and GHC 6.12:
import Network.Curl
u =
On 2010-04-24, John Goerzen jgoer...@complete.org wrote:
It is a funny thing, because our fundamental libraries *have* had time
to settle down, in a sense. In another sense, I must say that the
innovations we have seen recently have been sorely needed and are
unquestionably a good thing.
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 Apr 27, 2010, at 00:55 , Aaron Denney wrote:
I despair that a better Numeric hierarchy will never make it into
Haskell.
I thought the main reason for that was that nobody could agree on a
better hierarchy that was actually usable. (Nobody wants to chain
10 typeclasses together to get
79 matches
Mail list logo
