Hi!
I just got an idea for hackage feature. All functions/modules listed
there could have some mark if they or any function/module they use
uses an unsafe* function. Of course this will make probably almost
everything marked as unsafe, but this is the idea - to raise awareness
about that so that
On 16 September 2010 16:04, Mitar mmi...@gmail.com wrote:
Hi!
I just got an idea for hackage feature. All functions/modules listed
there could have some mark if they or any function/module they use
uses an unsafe* function. Of course this will make probably almost
everything marked as
As we were discussing in #haskell, it would have to be more involved than
just a taint bit. A listing showing the taint sources of a given package
would give you confidence in its good behavior.
For example, if my nice, pure package's taint list showed that my only taint
sources were through my
Hi all,
Often times when trying to pitch Haskell to potential clients the
concern is the lack of qualified developers willing to take on
projects. As I'm sure many of you are familiar with, clients prefer
not to be locked in to a single programmer: an errant bus can
significantly reduce the value
Alex Rozenshteyn rpglove...@gmail.com writes:
I understand that
fib50 = slowFib 50
will take a while to run the first time but be instant each subsequent call;
does this count as memoization?
I didn't see anybody else answering this in so many words, but I'd say
no, since you only name one
On 16/09/2010 08:52 AM, Michael Snoyman wrote:
Hi all,
Often times when trying to pitch Haskell to potential clients the
concern is the lack of qualified developers willing to take on
projects. As I'm sure many of you are familiar with, clients prefer
not to be locked in to a single
On 16 September 2010 17:00, Daniel Peebles pumpkin...@gmail.com wrote:
But maybe one day we'll have way more than just Stability: experimental;
Version: 0.0.1 on hackage, but instead:
Stability: experimental
Version: 0.0.1
Test coverage: 98%
User stability rating: 86%
User API quality
Yeah, those other things were part of the bigger picture that I hope
hackage will get some day: two axes of user rating, plus optional support
for visualizing things like test coverage and regression tests that you
include in your cabal file (cabal test was being worked on during one of
this
Yeah, those other things were part of the bigger picture that I hope
hackage will get some day: two axes of user rating, plus optional support
for visualizing things like test coverage and regression tests that you
include in your cabal file (cabal test was being worked on during one of
this
Jason Dagit dagit at codersbase.com writes:
preference: base = 4, parsec = 3
I am trying this, but ...
Warning: Error parsing config file /home/waldmann/.cabal/config:14:
Parse of field 'preference' failed (dependency expected): base = 4, parsec =
3
Warning: Using default configuration.
cabal
On Thu, Sep 16, 2010 at 10:26 AM, Andrew Coppin
andrewcop...@btinternet.com wrote:
On 16/09/2010 08:52 AM, Michael Snoyman wrote:
future it would be beneficial to the community to have this
information centralized on a website. I think it would be useful to
have some basic skills and
On 16 September 2010 21:48, Johannes Waldmann
waldm...@imn.htwk-leipzig.de wrote:
Jason Dagit dagit at codersbase.com writes:
preference: base = 4, parsec = 3
I am trying this, but ...
Warning: Error parsing config file /home/waldmann/.cabal/config:14:
Parse of field 'preference' failed
On Sep 16, 2010, at 6:45 AM, wren ng thornton wrote:
Given that any functor for adding strictness will have to deal with the same
issue of preserving bottom-eating compositions, I postulated that there
exists no functor from (all of) Hask to !Hask. But, since !Hask is a
subcategory of
The type (String - Maybe (a, String)) should already be an instance of
arbitrary if a is.
One way of generating functions is to have some sort of hashing function (a
- Int). Functions from a to b can be generating by using the hash value to
transform the random seed before the b is generated.
Hi. Consider for example an expression e0 like:
fst (True,e)
where e is any expression.
e0 should have type Bool IMHO irrespectively of the type of e. In Haskell
this is the case if e's type is monomorphic, or polymorphic, or
constrained and there is a default in the current module that
Sounds awesome! Why not grab .org too? or was that taken?
On Thu, Sep 16, 2010 at 2:35 PM, Michael Snoyman mich...@snoyman.comwrote:
On Thu, Sep 16, 2010 at 10:26 AM, Andrew Coppin
andrewcop...@btinternet.com wrote:
On 16/09/2010 08:52 AM, Michael Snoyman wrote:
future it would be
michael:
On Thu, Sep 16, 2010 at 10:26 AM, Andrew Coppin
andrewcop...@btinternet.com wrote:
On 16/09/2010 08:52 AM, Michael Snoyman wrote:
future it would be beneficial to the community to have this
information centralized on a website. I think it would be useful to
have some basic
I've been playing around with State Monads. Two I looked at earlier used
*sequence* and *replicate* but when I came to this one I found myself puzzling
over how to structure the problem when there was no predetermined count of how
many times to thread the state.
== Program 1
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 9/15/10 06:41 , Daniel Fischer wrote:
play a role. Since ghc fares pretty well on 64-bit linux (David Terei and
Don), both, via the NCG and via C, it seems its 64-bit code generator is
better than its 32-bit code generator :(
amd64 has more
On Sep 16, 2010, at 5:35 AM, Michael Snoyman wrote:
OK, I'll bite on this one. I just registered the domain name
haskellers.com (I was surprised it was available). So let me ask the
community what information they would want out there. Here's the ideas
I had:
* Users can create their own
Hi. I'm writing GUI (gtk) program which purpose is take some data as user
input, perform some evaluations, and produce some plots and coefficients.
Since some evaluations take significant time (about 10 seconds), I try to
cache results. The problem is that dependency structure is quite
On Thu, Sep 16, 2010 at 1:43 PM, Ville Tirronen alea...@gmail.com wrote:
I'd be happy even if there was a mandatory whats new field on packages. I
see version numbers flashing by but that doesn't really tell me whats
happening.
See:
http://hackage.haskell.org/trac/hackage/ticket/299
On 9/16/10 9:44 AM, Bas van Dijk wrote:
I try to add NEWS files to my packages source repositories[1] but it
sure would be nice if this file was directly shown on hackage.
Agreed. For now I sometimes put the most recent release notes in the description, like
Ivan Lazar Miljenovic schrieb:
On 16 September 2010 16:04, Mitar mmi...@gmail.com wrote:
Hi!
I just got an idea for hackage feature. All functions/modules listed
there could have some mark if they or any function/module they use
uses an unsafe* function. Of course this will make probably
Alex,
Maybe this pdf can enlighten you a little bit about memoization and lazy
evaluation in Haskell =
http://www.cs.uu.nl/wiki/pub/USCS2010/CourseMaterials/A5-memo-slides-english.pdf
Cheers.
Roman.-
I feel that there is something that I don't understand completely: I have
been told that
2010/9/16 Alexey Karakulov ankaraku...@gmail.com:
Hi. I'm writing GUI (gtk) program which purpose is take some data as user
input, perform some evaluations, and produce some plots and coefficients.
Since some evaluations take significant time (about 10 seconds), I try to
cache results. The
On Thu, Sep 16, 2010 at 4:48 AM, Johannes Waldmann
waldm...@imn.htwk-leipzig.de wrote:
Jason Dagit dagit at codersbase.com writes:
preference: base = 4, parsec = 3
I am trying this, but ...
Warning: Error parsing config file /home/waldmann/.cabal/config:14:
Parse of field 'preference'
I like this idea and would be happy to help if I can.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
wren ng thornton wrote:
On 9/13/10 6:22 AM, Michael Lazarev wrote:
Thanks for examples and pointers.
Since I came from Lisp, it never occurred to me that let and lambda
are different constructs in Haskell.
I thought that
let x = y in f
is really
(\x - f) y
It turns out that
2010/9/16 Evan Laforge qdun...@gmail.com:
2010/9/16 Alexey Karakulov ankaraku...@gmail.com:
Hi. I'm writing GUI (gtk) program which purpose is take some data as user
input, perform some evaluations, and produce some plots and coefficients.
Since some evaluations take significant time (about 10
Sjoerd Visscher wrote:
But StrictIncl can't be a pointed functor, only endofunctors can be
pointed.
Could someone tell me what exactly a pointed functor is? I googled but did
not find a definition.
Thanks
Ben
___
Haskell-Cafe mailing list
monte-carlo is a haskell library providing a monad and associated monad
transformer for computing with quasi-random numbers. It provides a high-level
interface to the distributions supported by the GNU Scientific Library
(currently just uniform, normal, exponential, Poisson, Levy, but others
I am not totally sure if I understand your proposal correctly, but if
I do, then it has a flaw. Consider:
class Boolable a where
boolify :: a - Bool
class O a where
o :: a
main = print $ boolify o
It seems like under your proposal this should not be a type error.
On Wed, Sep 15, 2010 at 12:45 AM, Chad Scherrer chad.scher...@gmail.com wrote:
Hello,
I need to be able to use strict bytestrings to efficiently build a
lazy bytestring, so I'm using putByteString in Data.Binary. But I also
need random numbers, so I'm using mwc-random. I end up in the IO Put
On 17 September 2010 03:18, Henning Thielemann
schlepp...@henning-thielemann.de wrote:
Ivan Lazar Miljenovic schrieb:
The problem with this is: unsafe* functions would be better called
yesIGuaranteeThatUsingThisFunctionDoesResultInAReferentiallyTransparentEntityAndItsOKForMeToUseIt*.
They
On Thu, Sep 16, 2010 at 4:00 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Because Parsec-3 apparently still has some speed regressions compared
to Parsec-2 (I'm not qualified to note whether its design is slow or
if you have to use it differently to get good performance out of
On Fri, Sep 17, 2010 at 1:44 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 17 September 2010 03:18, Henning Thielemann
My suggestion is to move the Unsafe modules to a new package 'unsafe'.
Then you can easily spot all dirty packages by looking at reverse
dependencies of
On 17 September 2010 10:12, Ben Millwood hask...@benmachine.co.uk wrote:
On Fri, Sep 17, 2010 at 1:44 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 17 September 2010 03:18, Henning Thielemann
My suggestion is to move the Unsafe modules to a new package 'unsafe'.
Then you can
-- Forwarded message --
From: Carlos Camarao carlos.cama...@gmail.com
Date: Fri, Sep 17, 2010 at 12:01 AM
Subject: Re: [Haskell-cafe] Reachable variables exercise
To: Luke Palmer lrpal...@gmail.com
boolify o has type Boolable a = Bool under the proposal, then
we have ambiguity,
This gets a little hilarious (but better to laugh than cry).
Well, I decided to try Parsec version 3 (i.e., 3.1.0) after all, and
edited my cabal config to include:
preference: parsec = 3
I did not include base = 4; hope that is not a problem.
I did cabal upgrade parsec, which went great.
It
Run ghc-pkg check, and do a cabal install --reinstall for all
packages that it says need to be rebuilt at the bottom.
On 17 September 2010 13:44, Peter Schmitz ps.hask...@gmail.com wrote:
This gets a little hilarious (but better to laugh than cry).
Well, I decided to try Parsec version 3
On 17 September 2010 13:52, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Run ghc-pkg check, and do a cabal install --reinstall for all
packages that it says need to be rebuilt at the bottom.
Actually, I just re-read your post and you seem to have bigger problems...
The cause of the
Ah... now I understand your concern; I should have written
something like:
where K +_t K' denotes the set of constraints from K plus
those from K' that have type variables reachable from t.
instead of:
where K +_t K' denotes the constraint-set obtained by adding from K'
only constraints
2010/9/16 Alexey Karakulov ankaraku...@gmail.com:
Hi. I'm writing GUI (gtk) program which purpose is take some data as user
input, perform some evaluations, and produce some plots and coefficients.
Since some evaluations take significant time (about 10 seconds), I try to
cache results. The
44 matches
Mail list logo
