the is the right contact and it seems like a pretty bad way
to start off with people who are trying to figure out what haskell
offers.
Thanks, Keith
On Thu, Sep 9, 2010 at 5:30 PM, Keith Sheppard wrote:
> Hello cafe,
>
> Maybe malicious isn't the right word but there is a JS bas
Hello cafe,
Maybe malicious isn't the right word but there is a JS based web
counter on http://www.haskell.org/complex/why_does_haskell_matter.html
which likes to show pop up adverts. They must have switched over from
counting visitors to showing adverts at some point since the web page
was create
ot; (be prepared for this to
take a couple of hours). ghc --version gives 6.10.4
- cabal install llvm
I still don't know the root cause of the build error but now the llvm
examples build and run with no errors.
-Keith
On Thu, Jun 17, 2010 at 10:46 PM, Keith Sheppard wrote:
> Hello All,
Hello All,
I'm trying to get up and running with the very interesting llvm
package[1] but I'm running into problems during the linking stage.
ke...@sugarglider-2:~/projects/third-party/llvm-hs-bindings/examples/>
make clean all
rm -f HelloJIT Fibonacci BrainF Vector Array DotProd Arith Align
Stru
What Gwern said for 1) and 3)
> 2) Not all head repositories are kept stable/buildable at all times.
>
Isn't it bad practice to not have a buildable repo? In any case
package owners would be free to use or ignore the data as they like,
but I'm pretty sure it would be useful to many.
Best, Keith
Sorry, "rerun the build" means rebuild my package and all of my
package's dependencies...
On Fri, Apr 23, 2010 at 7:11 PM, Keith Sheppard wrote:
>> 1) The buildbot will catch dependencies with compile errors, but only
>> after the package has been pushed, a
> 1) The buildbot will catch dependencies with compile errors, but only
> after the package has been pushed, and there is no easy way for
> packagers to check that this won't happen
>
An alternate solution that can be done completely outside the hackage loop:
Set up a server to poll the "Source-R
Using composition can be tricky with more than one arg. I just want to
be sure you're not really looking for something like:
> func :: (a -> Bool) -> (b -> Bool) -> (a -> b -> Bool)
keeping with your given type I think you're looking for something like:
> func f1 f2 x = (f1 x) || (f2 x)
I'm sur
Hello Mujtaba,
I wonder is this homework? If that's the case there is nothing wrong
with asking homework related questions but they should probably be
marked as such.
I think the most straight forward solution will use function
composition (.) and the (not) function
-keith
On Sun, Apr 18, 2010
Sorry, I forgot to add my ghc version is 6.10.1 on OSX
k...@catskill:~/projects/> ghc --version
The Glorious Glasgow Haskell Compilation System, version 6.10.1
On Fri, Apr 16, 2010 at 1:08 PM, Keith Sheppard wrote:
> Hello,
>
> I ran into this error while trying to install stat
Hello,
I ran into this error while trying to install statistics. Does this
indicate that I need to upgrade my GHC before I can install?
k...@catskill:~/projects/> cabal update
Downloading the latest package list from hackage.haskell.org
k...@catskill:~/projects/> cabal install statistics
Resolvi
Hello,
I am one.
Best
Keith
2010/3/28 Günther Schmidt :
> Hi guys,
>
> are there any gay haskellers?
>
> ... Since the first one was so much fun ;)
>
>
> Günther
>
>
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/
Hi, I think that Turbinado is no longer active since the author is
"leaving Haskell" (unless someone will adopt it)
http://www.alsonkemp.com/haskell/reflections-on-leaving-haskell/
-Keith
On Wed, Mar 17, 2010 at 5:25 PM, Hugo Gomes wrote:
> There is also turbinado. Im not sure about the current
I asked a similar question a while ago on the cafe
http://www.haskell.org/pipermail/haskell-cafe/2009-June/thread.html#62772
On Wed, Mar 10, 2010 at 5:33 PM, TeXitoi wrote:
> After programming as an exercice the sum function, my version is
> faster than the Data.List's version. Looking at the so
I did a blog post on basic matrix ops which may be useful to you
http://blog.keithsheppard.name/2009/06/bird-tracks-through-math-land-basic.html
It uses a 2D list representation for matrices which you would not do
for any performance critical work.
best
keith
On Wed, Feb 3, 2010 at 1:38 AM, 조광래
I have just started reading this so I don't know how good it is yet
but the draft is freely available:
http://research.microsoft.com/en-us/um/people/szeliski/Book/
Best
Keith
2010/1/25 Dan Mead :
> Hey all
>
> Can anyone recommend a good textbook on computer vision or image processing?
>
> I don
Hello Cafe,
I noticed on my package's hackage page there is a build failure message:
http://hackage.haskell.org/package/txt-sushi
I don't know if these are real errors or not (I don't experience them
on OS X and it's pure Haskell code) but I did poke around and noticed
that some popular packages
Hello, My impression is that using existential types where possible
will result in more complete type checking than Data.Dynamic but I'm
not sure since I haven't yet tried Data.Dynamic in my own code. Can
someone confirm if this is right?
Best
Keith
On Thu, Jan 7, 2010 at 2:02 PM, Christian Maede
Hello Cafe,
I've uploaded a new version of TxtSushi to
http://hackage.haskell.org/package/txt-sushi and announced the details
here http://blog.keithsheppard.name/2009/12/txtsushi-050.html.
TxtSushi is a set of command-line utilities for transforming CSV and
tab-delimited files including an SQL ba
23, 2009, at 1:19 PM, "Hector Guilarte"
wrote:
I'd like to help... I'm not an expert in Haskell, but I guess I
could help somehow...
Hector Guilarte
-Original Message-
From: jonathangfisch...@gmail.com
Date: Wed, 23 Dec 2009 18:11:21
To: Keith Sheppard;
I don't think such a tool exists. I think it would be a great
contribution if someone decides to create one.
Best
Keith
On Wed, Dec 23, 2009 at 12:34 PM, wrote:
> I would like to generate Haskell data types and xml serialization code from
> xsd. I know of DtdToHaskell but unfortunately I yet to
Hello, I didn't try to understand what the function is doing, but just
quickly noticed that
> reMatr a = Matr . (flip (.) unMatr) a
can be written as
> reMatr a = Matr . ((flip (.) unMatr) a)
but that
> reMatr = Matr . (flip (.) unMatr)
can be written as
> reMatr a = (Matr . (flip (.) unMatr))
What about if during the "Checking a Cabal package" upload step there
was a check to see if there was a homepage in the cabal file? If there
is no homepage we could have something like:
"Your cabal file does not contain a link to a project homepage. You
may want to add a haskell wiki link as your
There is nothing wrong with constructive criticism and debate. We
should welcome it and I think that the initial response did. But the
OP's follow up of:
"It will be better for all of you to figure it out for yourselves and
gain more experience about what is out there. Haskell isn't the world.
Has
hoogle is down for me: "Internal Server Error"
Thanks
Keith
--
keithsheppard.name
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello Philippos
> I received a lot of furious and offensive private emails for suggesting the
> Clean programmer to stick with Clean.
I don't get why some people think it's OK to be disrespectful just
because they're on the internet...
Regarding the code, I find it hard to follow without some h
I have to nominate "I'm lying here, but for a good cause" as a quote
of the week.
-Keith
On Mon, Oct 5, 2009 at 10:06 AM, Deniz Dogan wrote:
> 2009/10/5 Maria Boghiu :
>> I get an error saying I am mismatching types IO [String] and [String].
>
> Something of the type IO [String] is a computation
Hello Cafe,
I've just uploaded TxtSushi 0.4.0 to hackage. TxtSushi is a collection
of command line utilities for processing comma-separated and
tab-delimited files. I posted details on my blog (along with an
advertisement to see if others are interested in hacking TxtSushi):
http://blog.keithshepp
IMO google web toolkit has done this for Java and I haven't tried it
but maybe http://www.haskell.org/haskellwiki/Haskell_in_web_browser
does or will do this for Haskell. I still think that there is a place
for web applications that are smart on the server side though.
Best
-Keith
On Sun, Oct 4,
I think having access to the parsec library would be a major plus that
you can show off. Eg: you can have a RoR based email web app that uses
parsec parsing to figure out which sections of an email thread belong
to which author...
Best
-Keith
On Sat, Oct 3, 2009 at 11:08 PM, Mark Wotton wrote:
>
This seems to me like the kind of thing hackage maintainers should be
giving guidance on (maybe they do already?) so that there is
consistency.
Sorry if this seems too off base, but here I go anyway... I have used
apache IVY for packaging/dependency management in java and I really
like the way it
Hello Dmitry,
I too was looking for something like this and came up empty. I
proposed something similar on the haskell_proposals reddit...
http://www.reddit.com/r/haskell_proposals/comments/8zhkx/haxb_and_haxws/
... but I was left with the impression that there isn't much interest.
-Keith
On W
That's perfect. Thanks!
On Sat, Jul 11, 2009 at 12:10 AM, Gwern Branwen wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA512
>
> On Fri, Jul 10, 2009 at 11:46 PM, Keith Sheppard wrote:
>> Is there a way for a cabalized program to get its own info. I'm
>>
Is there a way for a cabalized program to get its own info. I'm
specifically interested in version info.
Thanks
Keith
--
keithsheppard.name
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I see some parallels between Inversion of Control/Dependency Injection
frameworks and monads. I would say annotations are tools that are
sometimes used for those frameworks, but they are also used for other
unrelated things (warning suppression, overriding functions ...) so it
may be more clear to
Hello Cafe,
I'm looking to make it possible for people to use urls directly in my
haskell program (TxtSushi) and I'd like your suggestions if you have
any. I really like the API's for download and download-curl, but I'm
wondering what the practical differences are between the two? Is
download-curl
scratch that... it's completely wrong
On Sun, Jun 21, 2009 at 1:09 PM, Keith Sheppard wrote:
> forgot to cc the cafe :-)
>
> On Sun, Jun 21, 2009 at 1:08 PM, Keith Sheppard wrote:
>> hmm, it's been a while but...
>>
>> i think this "infinite loop&q
forgot to cc the cafe :-)
On Sun, Jun 21, 2009 at 1:08 PM, Keith Sheppard wrote:
> hmm, it's been a while but...
>
> i think this "infinite loop" with a free variable would cause collision
>
> (\a . a a) (\b . b b d)
>
> On Sun, Jun 21, 2009 at 12:53 PM,
rch encoding or some
equivalent?
-Keith
On Thu, Jun 18, 2009 at 7:53 AM, Thomas Davie wrote:
> No, I think it's extremely useful. It highlights that numbers can both be
> lazy and strict, and that the so called "useless" lazy sum, is in fact,
> useful.
>
> Bob
>
>
k what types you
> make instances of Num.
> Some of them are lazy, some of them are strict.
>
> On Wed, Jun 17, 2009 at 11:05 PM, Keith Sheppard wrote:
>> In lambda calculus numbers are just functions and you evaluate them
>> just like any other function. Haskell could have chose
ls can be overloaded to be
> functions I don't know what you mean.
>
> On Wed, Jun 17, 2009 at 9:50 PM, Keith Sheppard wrote:
>> Haskell's numeric literals are strict. You wouldn't want that to
>> change right? It seems to me that having sum and product be strict is
&g
Haskell's numeric literals are strict. You wouldn't want that to
change right? It seems to me that having sum and product be strict is
consistent with this.
-Keith
On Wed, Jun 17, 2009 at 11:15 AM, Thomas Davie wrote:
>
> On 17 Jun 2009, at 13:32, Yitzchak Gale wrote:
>
>> Henk-Jan van Tuyl wrote
I just realized... that was a statement not a question :-)
anyway, thanks
Keith
On Mon, Jun 15, 2009 at 11:14 AM, Don Stewart wrote:
> keithshep:
>> Is there any reason that sum isn't strict? I can't think of any case
>> where that is a good thing.
>>
>> Prelude> sum [0 .. 100]
>> *** Excepti
The answer is sometimes (only if you use an optimize flag):
ke...@sugarglider:~/temp/> cat sumtest.hs
main = putStrLn . show . sum $ [0 .. 100]
ke...@sugarglider:~/temp/> ghc --make sumtest.hs
[1 of 1] Compiling Main ( sumtest.hs, sumtest.o )
Linking sumtest ...
ke...@sugarglider:~
That's an interesting example. I guess a lazy number system like that
would work nicely for Deniz's use case.
On Sat, Jun 13, 2009 at 10:26 AM, Stephan
Friedrichs wrote:
> Jochem Berndsen wrote:
>> Keith Sheppard wrote:
>>> Is there any reason that sum isn't
Is there any reason that sum isn't strict? I can't think of any case
where that is a good thing.
Prelude> sum [0 .. 100]
*** Exception: stack overflow
-Keith
--
keithsheppard.name
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.ha
I guess the short answer is that it is not possible. 'x' is immutable
and if you want a different value than 'x' that expression has to be
given a different name like:
let x=1
y=x+2
...
But I'm not sure if that helps you. Haskell does things very
differently than the imperative languages a
announce
major updates from now on and if you want to follow progress more
closely I'll post all updates to this feed.
http://blog.keithsheppard.name/feeds/posts/default/-/TxtSushi
Thanks,
Keith
On Sun, May 17, 2009 at 11:07 AM, Keith Sheppard wrote:
> Hello Haskell Cafe
>
>
Thanks! Good advice, I will do that.
On Sun, May 17, 2009 at 11:49 AM, Jochem Berndsen wrote:
> Keith Sheppard wrote:
>> I have released the first version of TxtSushi which is a collection of
>> command line utils (written in haskell of course) for processing
>> tab-delimi
uld consider switching to ByteString's,
> and beware memory leaks.
>
> 2009/5/17 Keith Sheppard :
>> Hello Haskell Cafe
>>
>> I have released the first version of TxtSushi which is a collection of
>> command line utils (written in haskell of course) for process
Hello Haskell Cafe
I have released the first version of TxtSushi which is a collection of
command line utils (written in haskell of course) for processing
tab-delimited and CSV files. It includes a util for doing SQL SELECTs
on flat files. This is my first haskell project and feedback of all
kinds
I'm still learning haskell, so I may be missing something pretty
obvious, but isn't this the kind of thing that the diff array types
were created for.
http://en.wikibooks.org/wiki/Haskell/Hierarchical_libraries/Arrays#DiffArray_.28module_Data.Array.Diff.29
-Keith
>On Thu, Feb 26, 2009 at 06:45:2
52 matches
Mail list logo
