On 23 Apr 2009, at 5:17 pm, Edward Middleton wrote:
Richard O'Keefe wrote:
The clear impression I've received on this mailing list
is that cabal is _also_ for people who are using Haskell
and find that there's a new package reported in HWN that
they'd like to have. If you are now telling
Richard O'Keefe wrote:
The thing is that it really seems bizarre to see this one feature
singled out for non-implementation.
If I can do the equivalent of n+k patterns by programming in the
*type system*, why *not* in a pattern?
Do you mean by something like the following?
data Z = Z
[Moved from the UHC thread – lets stop treading on those guys toes,
they did something very very shiny]
On 23 Apr 2009, at 07:02, Richard O'Keefe wrote:
It's irrelevant, because I _do_ have root access to my machine,
How nice to be you.
Since the argument is entirely about people who
The results in the poll seem to have stabilised now, so I'll tell you
what happened...
For user installs: 103
For global installs: 52
Others: 9
Interesting Ideas:
• Claus made the suggestion that there be no default, instead that
cabal asks you which you prefer the
Some material I've read on typography -- can't find the
reference now -- suggests ~65 is the best number of characters
per line. The advice was, if your page is larger than that,
you should make columns.
That fits my observations. In particular, I noticed that your emails were
On 23 Apr 2009, at 10:02, Matthijs Kooijman wrote:
Some material I've read on typography -- can't find the
reference now -- suggests ~65 is the best number of characters
per line. The advice was, if your page is larger than that,
you should make columns.
That fits my observations. In
On 23 Apr 2009, at 12:17, Thomas Davie wrote:
On 23 Apr 2009, at 10:02, Matthijs Kooijman wrote:
Some material I've read on typography -- can't find the
reference now -- suggests ~65 is the best number of characters
per line. The advice was, if your page is larger than that,
you should make
Thanks for all that. Some good suggestions.
I've linked the results in the ticket on this issue so someone can
re-read all the suggestions in detail when they come to update the
behaviour (hopefully for 0.6.4 or something).
http://hackage.haskell.org/trac/hackage/ticket/289#comment:17
Duncan
Ross Mellgren wrote:
True enough -- if you really want to redefine the monadic operator, you
have to use
{-# LANGUAGE NoImplicitPrelude #-}
import Prelude hiding ((), (=), return)
or something like it, although Michael's example didn't appear to be
going quite that far.
Or just make
Lennart == Lennart Augustsson lenn...@augustsson.net writes:
Lennart Of course, n+k will be missed by Haskell obfuscators. I
Lennart mean, what will we do without (+) + 1 + 1 = (+) ?
I think what would be missed would you be having the opportunity to
explain to me what it means.
But
Jon Fairbairn wrote:
John A. De Goes j...@n-brain.net writes:
That's absurd. You have no way to access private source code, so any
decision on what features to exclude from future versions of Haskell
must necessarily look at publicly accessible source code.
This is all entirely beside the
Let me parenthesise and rename
(n + 1) +++ 1 = n
This defines a function +++, first argument is a n+1 pattern, second
argument is 1.
In the same way,
(+) + 1 + 1 = (+)
defines a function +, first argument is n+1 (but using (+) as n),
second argument is 1.
On Thu, Apr 23, 2009 at 10:27 AM,
Colin Paul Adams co...@colina.demon.co.uk writes:
Lennart == Lennart Augustsson lenn...@augustsson.net writes:
Lennart Of course, n+k will be missed by Haskell obfuscators. I
Lennart mean, what will we do without (+) + 1 + 1 = (+) ?
I think what would be missed would you be having
Sittampalam, Ganesh ganesh.sittampa...@credit-suisse.com writes:
Jon Fairbairn wrote:
But we can remove them in future language versions. The point I was
trying to make at the beginning of this subthread was that
implementations should follow the definition, because having a core
language
John A. De Goes j...@n-brain.net writes:
That's absurd. You have no way to access private source
code, so any decision on what features to exclude from
future versions of Haskell must necessarily look at
publicly accessible source code.
This is all entirely beside the point. The question
michael rice wrote:
Here's what I get:
[mich...@localhost ~]$ ghci
GHCi, version 6.10.1: http://www.haskell.org/ghc/ :? for help
Loading package ghc-prim ... linking ... done.
Loading package integer ... linking ... done.
Loading package base ... linking ... done.
Prelude import Prelude
Achim Schneider wrote:
Well, you obviously need an initial seed:
rollDie 0xdeadbeef ~ (rollDie ~ rollDie)
Achim means
(rollDie ~ (rollDie ~ rollDie)) 0xdeadbeef
Regards,
apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
On Thu, Apr 23, 2009 at 6:30 AM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
- a somewhat bogus claim about how much of the library you need to
know how to use it (of COURSE you need to know about integers in
order to use an integer operation, what's so bad about that?)
- the claim that +
Dominic Steinitz dominic.stein...@blueyonder.co.uk wrote:
I want to use hpc to check that the ASN.1 library tests cover all the
code. When I run it with a set of tests that I *know* don't test
certain things, it reports that they have been covered i.e. there are
not coloured in the markup
On Wed, Apr 22, 2009 at 10:38 AM, Daniel K. anmeldema...@gmail.com wrote:
Dijkstra's algorithm ... relies heavily on mutating arrays
Well, the imperative implementation does.
Not mutating the underlying arrays would probably result in poor
performance.
Indeed. Non-mutable arrays are not very
OK, the 3rd and 4th responses below are the same, which is as it should be. I
think we can put this thread to bed.
Thanks to all who participated.
Michael
*Main rollDie 362354
(3,1795116384)
*Main rollDie 1795116384
(1,523309185)
*Main rollDie 523309185
(4,1311937830)
*Main (rollDie ~ (rollDie
Just my two cents. The open source project Maxima is a very successful
math engine dedicated to solving ODE PDE and integration among many
other things. It is implemented in LISP.
Steve
On 4/21/09, jean-christophe mincke jeanchristophe.min...@gmail.com wrote:
Peter, Paul,
But my question is,
Am Donnerstag 23 April 2009 14:15:16 schrieb Max Rabkin:
On Wed, Apr 22, 2009 at 10:38 AM, Daniel K. anmeldema...@gmail.com wrote:
Dijkstra's algorithm ... relies heavily on mutating arrays
Well, the imperative implementation does.
Not mutating the underlying arrays would probably result
Dear Haskell Hackers,
Many thanks to all those who attended Hac5! We had a spectacular number
of participants: over 50 hackers showed up, representing several
countries. Many thanks also to the organising committee and sponsors!
Those bagels on Sunday were delicious. :-)
Please check out
Hahah yeah of course, I left it implicit that you'd only do this if
you were changing the types (e.g. parameterized monads or what have you)
-Ross
On Apr 23, 2009, at 5:15 AM, Heinrich Apfelmus wrote:
Ross Mellgren wrote:
True enough -- if you really want to redefine the monadic operator,
On Apr 22, 2009, at 11:30 PM, Richard O'Keefe wrote:
so any decision on what features to exclude from future versions of
Haskell must necessarily look at publicly accessible source code.
Wrong. There is no necessarily about it. People made decisions
about what to deprecate in the Fortran
Let's turn this around. You invest 4 months of your life coming out
with your own experimental Haskell compiler designed to easily test
new language features. Then a bunch of ungrateful wretches on Haskell
Cafe demand that you stop distributing your compiler until you have
full support
Hoi Peter,
Peter Verswyvelen wrote:
Sure I understand what a GADT is, but I'm looking for practical
examples, and the ones on the wiki seem to show what you *cannot* do
with them...
I use GADTs for two things:
1) Type witnesses for families of data types. An example from the
MultiRec
Jon Fairbairn wrote:
Sittampalam, Ganesh ganesh.sittampa...@credit-suisse.com writes:
So I would say that {Haskell 98 - (n+k)} is itself a worthwhile
standard to implement.
It's not a standard. You have to document the difference (waste of
time), programmers have to notice the difference
Hi, all!
I saw GHC release new version now, and fix some bug.
I want to know below pacakges whether works fine with GHC-6.10.2 before i
upgrade it:
cabal, gtk2hs, xmonad, yi, leksah
Thanks!
-- Andy
___
Haskell-Cafe mailing list
Am Donnerstag 23 April 2009 16:13:36 schrieb John A. De Goes:
Let's turn this around. You invest 4 months of your life coming out
with your own experimental Haskell compiler designed to easily test
new language features. Then a bunch of ungrateful wretches on Haskell
Cafe demand that you
Am Mittwoch, 22. April 2009 16:00 schrieb Patai Gergely:
This also means that if you want to restart a signal without external
dependencies using a latcher, you have to inject some bogus dependency
to prevent memoisation. If the new signal depends on some others,
latching should behave
Hi again,
The problem here turned out to be a too-lazy Data.Binary instance for
Entry. Using seq to force each number before wrapping it in an Entry
made those retainers go away.
I have yet another leaking problem, but I need to figure out which
question to ask of the mailing list first.
On Thu, Apr 23, 2009 at 05:30:52PM +1200, Richard O'Keefe wrote:
Is there a simple way to download everything from Hackage?
There's a link on the HackageDB introduction page.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I pretty much followed the sequence of steps that led to this final code (see
below), but will be looking it over for a while to make sure it sinks in. In
the meantime, I get this when I try to use it (sumTwoDice) at the command line:
[mich...@localhost ~]$ ghci rand9
GHCi, version 6.10.1:
Am Donnerstag 23 April 2009 17:28:58 schrieb michael rice:
I pretty much followed the sequence of steps that led to this final code
(see below), but will be looking it over for a while to make sure it sinks
in. In the meantime, I get this when I try to use it (sumTwoDice) at the
command line:
So there are a couple problems. First is you are trying to rebind
prelude functions, when instead you should be creating an instance of
Monad. This requires a bit of shuffling because without language
extensions you can't instance Monad Random for your type of Random, as
it is a type
On Apr 23, 2009, at 11:28 , michael rice wrote:
interactive:1:0:
No instance for (Show (Seed - (Int, Seed)))
arising from a use of `print' at interactive:1:0-9
Possible fix:
add an instance declaration for (Show (Seed - (Int, Seed)))
In a stmt of a 'do' expression: print
So does this mean that whether a signal is started at the
beginning or at switching time depends on what dependencies the
signal has?
No, the situation is even more complicated, since some of its
dependencies might be aged through other dependency chains, while
others can only be animated
Let's turn this around. You invest 4 months of your life coming out
with your own experimental Haskell compiler designed to easily test
new language features. Then a bunch of ungrateful wretches on Haskell
Cafe demand that you stop distributing your compiler until you have
full support for
I think the non-applicable to code observation is very likely true –
we'd like to be able to write nice descriptive variable names.
In doing this, we probably want them to be more than the 1 or
2 characters that Haskellers traditionally use, maybe of the order of
5-10.
Given this, it
I'm not sure why building of my recently uploaded version of dataenc
fails to build on Hackage[1]. Where can I find out what version of base
is available on Hackage?
/M
[1]:
http://hackage.haskell.org/packages/archive/dataenc/0.12.1.0/logs/failure/ghc-6.10
--
Magnus Therning
Hello Magnus,
Thursday, April 23, 2009, 8:47:23 PM, you wrote:
base is built-in into ghc/hugs/...
it never can be on hackage
I'm not sure why building of my recently uploaded version of dataenc
fails to build on Hackage[1]. Where can I find out what version of base
is available on Hackage?
On Thu, Apr 23, 2009 at 05:47:23PM +0100, Magnus Therning wrote:
I'm not sure why building of my recently uploaded version of dataenc
fails to build on Hackage[1]. Where can I find out what version of base
is available on Hackage?
The build client uses ghc 6.10.2 (including base 4.1.0.0).
Just a tought: I would like to see a guide talking about the
code itself, not about the presentation. (...)
(...)
It's difficult because it's not a question of science, but rather a
question of aesthetics. And as anyone in the humanities can tell you,
(...)
Maybe we could learn with them:
2009/04/23 Maurício briqueabra...@yahoo.com:
Maybe we could learn with them: what about if Haskell Weekly
News had a section on code review, like many newspapers have
book review sections?
This seems worthwhile.
--
Jason Dusek
___
Haskell-Cafe
About two days ago the beta version of the Haskell Platform was released. Since
it comes with an OpenGL library, it is now trivially easy to start making
OpenGL programs with Haskell. To test this, I decided to make a simple Pong
clone for two reasons:
* To experiment with making an OpenGL
On Thu, Apr 23, 2009 at 12:39 PM, Claus Reinke claus.rei...@talk21.com wrote:
...
joking and bikeshedding aside:
- Haskell'98 is a fixed standard. Haskell'98 (revised) is a revised version
of
the same standard. The discussion on what is in either is over. Unless
someone wants to start and
*Main :t rollDie ~ (rollDie ~ rollDie)
rollDie ~ (rollDie ~ rollDie) :: Seed - (Int, Seed)
This is a function. How exactly do you want ghci to show it? When you
figure that out, feel free to make an instance of Show for it.
Meanwhile, you can just apply the function to a Seed value and see
Bulat Ziganshin wrote:
Hello Magnus,
Thursday, April 23, 2009, 8:47:23 PM, you wrote:
base is built-in into ghc/hugs/...
it never can be on hackage
I don't mean downloadable from Hackage I mean used when compiling
packages on Hackage. Follow the link and you'll see what I mean :-)
I'm
On Thu, Apr 23, 2009 at 6:02 PM, Ross Paterson r...@soi.city.ac.uk wrote:
On Thu, Apr 23, 2009 at 05:47:23PM +0100, Magnus Therning wrote:
I'm not sure why building of my recently uploaded version of dataenc
fails to build on Hackage[1]. Where can I find out what version of base
is available
On Thu, Apr 23, 2009 at 06:46:24PM +0100, Magnus Therning wrote:
On Thu, Apr 23, 2009 at 6:02 PM, Ross Paterson r...@soi.city.ac.uk wrote:
On Thu, Apr 23, 2009 at 05:47:23PM +0100, Magnus Therning wrote:
I'm not sure why building of my recently uploaded version of dataenc
fails to build on
Thanks for this example I get the point now. (at least i think i do :) )
One more question This all being on the same category then the functor
transformation can also be view as a simple morphism too. In this example
the listToMaybe can be viewed as morphism between list and Maybe types
Ross Paterson wrote:
On Thu, Apr 23, 2009 at 06:46:24PM +0100, Magnus Therning wrote:
On Thu, Apr 23, 2009 at 6:02 PM, Ross Paterson r...@soi.city.ac.uk wrote:
On Thu, Apr 23, 2009 at 05:47:23PM +0100, Magnus Therning wrote:
I'm not sure why building of my recently uploaded version of dataenc
Thanks to everybody. Now I have enough articles to ruin my spare time again
:)
On Thu, Apr 23, 2009 at 4:20 PM, Martijn van Steenbergen
mart...@van.steenbergen.nl wrote:
Hoi Peter,
Peter Verswyvelen wrote:
Sure I understand what a GADT is, but I'm looking for practical examples,
and the
On Thu, Apr 23, 2009 at 7:02 AM, Mozhgan Kabiri mozhgan_...@hotmail.comwrote:
Hi Luck ,
I got you email from the Haskell Cafe list. Hope you don't mind.
Recently I was running a simple program in Haskell and keep getting ***
Exception: stack overflow error !
I don't know how to solve
*Main :t rollDie ~ (rollDie ~ rollDie)
rollDie ~ (rollDie ~ rollDie) :: Seed - (Int, Seed)
This is a function. How exactly do you want ghci to show it? When you
figure that out, feel free to make an instance of Show for it.
Just because user programs can't show function internals (they can
I don't know the exact reason but this should not fail since I have
Debian packaged ghc 6.10.1 and OpenGL-2.2.1.1 on my system.
I think this is because the filename of the OpenGL shared library is
/usr/lib/libGL.so.1 rather than libGL.so. This is why we have two
binary distributions for
On 23 Apr 2009, at 23:07, Claus Reinke wrote:
*Main :t rollDie ~ (rollDie ~ rollDie)
rollDie ~ (rollDie ~ rollDie) :: Seed - (Int, Seed)
This is a function. How exactly do you want ghci to show it? When
you figure that out, feel free to make an instance of Show for it.
Just because user
On Thursday 23 April 2009 2:44:48 pm Daryoush Mehrtash wrote:
Thanks for this example I get the point now. (at least i think i do :) )
One more question This all being on the same category then the functor
transformation can also be view as a simple morphism too. In this example
the
On Thu, Apr 23, 2009 at 9:06 PM, Luke Palmer lrpal...@gmail.com wrote:
However, there is a function sum in the prelude, so you can do this much
more simply:
sumit :: Int - Int
sumit n = sum [1..n]
:-)
Yeah, but this prelude sum function suffers from the same stack overflow
thing (which
On Thu, Apr 23, 2009 at 1:34 PM, Miguel Mitrofanov miguelim...@yandex.ruwrote:
Well, than, what would you expect from this:
let {f x = g x;
g 0 = 0;
g n = f (n-1)}
in show f
Well, not show, because any show instance for functions breaks r.t. But the
interactive interpreter, if
Thanks this was helpful.
In many of Conal Elliot's writings I see that he shows that his semantic
function is a natural transformation. Is that just basically showing the
polymorphic nature of his semantic functions, or are there other benifits
you get by showing a particular function is a
Ahn, Ki Yung wrote:
I don't know the exact reason but this should not fail since I have
Debian packaged ghc 6.10.1 and OpenGL-2.2.1.1 on my system.
I think this is because the filename of the OpenGL shared library is
/usr/lib/libGL.so.1 rather than libGL.so. This is why we have two
No.
Hi Ross,
Thanks for going the extra mile. A lot of what you did I haven't seen before,
so it's going to take me some time to go through it. But I'll be back.
Michael
--- On Thu, 4/23/09, Ross Mellgren rmm-hask...@z.odi.ac wrote:
From: Ross Mellgren rmm-hask...@z.odi.ac
Subject: Re:
Well, than, what would you expect from this:
let {f x = g x;
g 0 = 0;
g n = f (n-1)}
in show f
Well, not show, because any show instance for functions breaks r.t. But the
interactive interpreter, if it is not subject to r.t., might show:
let { f x = g x;
g 0 = 0;
g n = f
Daniel Fischer daniel.is.fisc...@web.de wrote:
Well, if it doesn't implement the full standard, perhaps it should
rather be called UVNABNQHC (Utrecht very nearly, almost but not quite
Haskell compiler)?
Ha! Haskell™!
I said it first, and rule that...
I don't care what you use the name for.
Maurício briqueabra...@yahoo.com wrote:
Maybe we could learn with them: what about if Haskell Weekly
News had a section on code review, like many newspapers have
book review sections?
The weekly WTF?
--
(c) this sig last receiving data processing entity. Inspect headers
for copyright
Ahn, Ki Yung kya...@gmail.com writes:
I think this is because the filename of the OpenGL shared library is
/usr/lib/libGL.so.1 rather than libGL.so.
No. Do not manually create the symlink. It sounds like you don't
have the -dev packages for OpenGL installed.
I do already have the dev
Duncan Coutts wrote:
Thanks for all that. Some good suggestions.
I've linked the results in the ticket on this issue so someone can
re-read all the suggestions in detail when they come to update the
behaviour (hopefully for 0.6.4 or something).
On 23 Apr 2009, at 7:39 pm, Thomas Davie wrote:
His point is that that kind of person is not the only kind of
person, so to base an argument on what they want is as weak as
basing an argument on what he wants.
But that is PRECISELY what I am arguing.
I'm arguing that
On Thu, Apr 23, 2009 at 8:29 PM, Achim Schneider bars...@web.de wrote:
Maurício briqueabra...@yahoo.com wrote:
Maybe we could learn with them: what about if Haskell Weekly
News had a section on code review, like many newspapers have
book review sections?
The weekly WTF?
I'm not sure such
Hello,
Hoogle allows me to query about Haskell functionality. But is there a
mechanism for querying about a package, e.g. Swish?
Kind regards, Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Gwern Branwen gwe...@gmail.com writes:
I was cabalizing a package once, and I chucked into the build-depends
'ghc' and made it build. About 30 seconds later, it occurred to me
that this was a geometry library and what the heck was it doing with
the GHC API? So I go looking, and I find a
On 23 Apr 2009, at 9:02 pm, Lennart Augustsson wrote:
On Thu, Apr 23, 2009 at 6:30 AM, Richard O'Keefe o...@cs.otago.ac.nz
wrote:
- a somewhat bogus claim about how much of the library you need to
know how to use it (of COURSE you need to know about integers in
order to use an integer
75 matches
Mail list logo
