I would guess they mean 'musique concréte'. It's a proto-electronic
experimental music genre.
http://en.wikipedia.org/wiki/Musique_concr%C3%A8te
On Nov 28, 2012, at 10:11 AM, Simon Peyton-Jones simo...@microsoft.com wrote:
Friends
You may enjoy this weird 2-minute video:
I miss it too,
I've got one person set up (or in the process of setting up) to take
it over. I'll be happy to help anyone else get set up (the tools are
nontrivial to use at first). The current plan, when I finally get back
on my feet, is to have multiple editors trading off weeks/months/
Yah, this is gonna sound like a crappy thing -- but my computer is
still broken. What I thought was a faulty SATA port seems to actually
be an issue with the harddrive, so -- one more week is the punchline.
I'm really sorry guys...
/Joe
On Jun 23, 2010, at 10:13 AM, aditya siram wrote:
While I would not be opposed to being paid, I don't think it's at all
necessary or even really appropriate. I liken the job to volunteering
at a local community action group -- not really the kind of thing you
get paid for.
That said, if any of you have time machines/time dilation devices
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
will always be HWN, at least as long as I can keep it that way. :D
/Joe
On Apr 26, 2010, at 8:17 PM, Ivan Miljenovic wrote:
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
Consider the set of all rationals with 1 as a numerator, and positive
denominator, eg:
S = {1/n, n : Nat}
this is bounded, enumerable, but infinite. Which makes the whole
checking every value bit somewhat, shall we say, difficult. :)
So for instance, we want to show
f : S
Exactly, it's not like the Hackage people are doing extensive
background checks of everyone, they just want something consistent.
You guys don't _really_ think my name is Joe Fredette, right?
I'm actually Batman.
/Joe
On Apr 4, 2010, at 7:58 PM, Jesper Louis Andersen wrote:
On Mon, Apr 5
, 2010, at 4:52 AM, Ivan Lazar Miljenovic wrote:
Joe Fredette jfred...@gmail.com writes:
You guys don't _really_ think my name is Joe Fredette, right?
I'm actually Batman.
Batman, Joe, whatever your name is...
I notice that the HWN has turned into the Haskell
Whenever-I-can-be-bothered-getting
Thats what I _want_ you to think. :)
On Apr 5, 2010, at 10:28 AM, Ivan Lazar Miljenovic wrote:
Joe Fredette jfred...@gmail.com writes:
Unfortunately, Ivan, it's not so much the Whenever-I-can-be-bothered
and more the Joe-had-4-finals-in-2-weeks-and-3-papers-to-write. HWN
should be back
Indeed, the Unicode only made it through my system, and not the mailer
itself. In fact, the name should look something like Ćwikłowski,
and not the garbled mess that made it through. Apologies again, Bartek!
/Joe___
Haskell mailing list
Indeed, the Unicode only made it through my system, and not the mailer
itself. In fact, the name should look something like Ćwikłowski,
and not the garbled mess that made it through. Apologies again, Bartek!
/Joe___
Haskell-Cafe mailing list
English, while my first language (and in fact, only language...) is
also my worst language... Thanks for catching the grammar snafu.
While I'm here, please note that the issue number is off as well, it's
fixed in the version on sequence.complete.org, but not in the email
version.
/Joe
Here's a completely naive implementation, it's slow as cold molasses
going uphill during a blizzard, but it doesn't seem to be wrong. I let
it run in the interpreter for the last 3 minutes or so and it's
reproduced the given list up to 126 (and hasn't crapped out yet).
I imagine there's
I think it makes sense, the HP is supposed to set up the entire
environment needed for typical haskell development (at least, that is
my understanding). As such, what's the point in making downloading
haskell mean downloading a single _peice_ of haskell (GHC) only to
have to download
Yah! We like helping!
On Dec 3, 2009, at 2:37 PM, Daniel Fischer wrote:
Am Donnerstag 03 Dezember 2009 19:23:24 schrieb Tom Tobin:
2009/12/3 Matthias Görgens matthias.goerg...@googlemail.com:
Hi Tom,
Did you make any progress on your Dominion quest? I guess you could
start by modeling `Big
I think you meant to say:
Now is the winter of our discontent with this troll
made glorious summer by this son of Fischer.
So long as we bastardize the bard, we best bastardize him fully! :)
/Joe
On Dec 3, 2009, at 2:58 PM, Miguel Mitrofanov wrote:
Brilliant. Just brilliant.
On 3 Dec
The Mayan's Set 'em up, Haskellers knock them down...
On Dec 4, 2009, at 1:36 AM, Evan Laforge wrote:
I'd just like to point out or reiterate the odd rise in trolling
and the
recent announcements of haskell-2010...
Just wait until haskell-2012 is announced with nonexistential aka
Hey folks,
I'm at home this weekend, and the internet is somewhat dodgey, so
I'm going to delay the special Thanksgiving episode of the HWN till
sunday afternoon...
I suppose the Turkey-coma isn't helping either, but I'll never admit
it...
/Joe
Hey folks,
I'm at home this weekend, and the internet is somewhat dodgey, so
I'm going to delay the special Thanksgiving episode of the HWN till
sunday afternoon...
I suppose the Turkey-coma isn't helping either, but I'll never admit
it...
/Joe
I censored it because I intend the HWN to be a PG rated article. I
figure -- while I am not under any delusion that kids these days have
mouths fouler than mine, which is a feat for sure -- that some young
programmer with strict speaking morals may stumble upon the HWN and say,
Hey self!
Awesome, however, I don't know what the policy is for such --
interesting -- names on Hackage. Normally I believe the response to
Should I put it on Hackage is a resounding, immediate Absolutely.
In this case, perhaps a small name change to avoid any possibility of
offense?
/Joe
On
Well then, send it up to the great Hackage machine! If the f-bombs are
allowed...
I think my package names are about to get alot less SFW...
On Nov 16, 2009, at 12:26 PM, Gwern Branwen wrote:
On Mon, Nov 16, 2009 at 12:23 PM, Joe Fredette jfred...@gmail.com
wrote:
Awesome, however, I
Hiya Haskellers,
So there I was, punching away at the keys, working on the Haskell
Weekly News tools when the solution to one of my problems fell on me
like a ton of lambdas. The solution and problem it solved are
immaterial, but suffice to say it involved the combination of
associated
Okay, so -- I feel totally awesome -- I never found a GHC bug
before... and a Haskell Celebrity responded to my post! *swoons* :)
Serious question now, There's a fair amount of definitely irrelevant
code (like the definition of the `Email` type, etc), should I post
that in the report too
, at 12:58 PM, Joe Fredette wrote:
Okay, so -- I feel totally awesome -- I never found a GHC bug
before... and a Haskell Celebrity responded to my post! *swoons* :)
Serious question now, There's a fair amount of definitely irrelevant
code (like the definition of the `Email` type, etc), should
Forall means the same thing as it means in math, it means for any
type -- call it `b` -- then the type of the following it `Branch
(PermParser tok st (b - a)`
`tok`, `st` and `a` are all given by the declaration of the datatype
itself.
Hope that makes sense,
/Joe
On Nov 11, 2009, at
That sounds vaguely ominous... Sir, we've achieved reactive in
O'Haskell, we'll have ten minutes till the VB GUI detects his IP
address!
...
But in all seriousness, it is my understanding that O'Haskell has
fallen into disuse. IIRC Timber is the spiritual successor, but I have
no idea
(+) is a name that is already taken by the Num typeclass, you're
trying to overload it with a different class. It's equivalent to doing:
foo :: Int
foo = 1
foo :: String
foo = abc
this would cause an (obvious) namespace collision. If you want to
redefine (+), you'll have to import a
Oh, crap, I'm sorry, I completely misread your post...
Disregard my previous message.
/Joe
On Nov 9, 2009, at 1:44 PM, Paul Tokarev wrote:
Hi.
I am using Hugs 98
I have that piece of code:
class PlusTimes a where
plus :: a - a - a
instance PlusTimes Int where
plus x y = x + y
when
You might peek at my library HCard (it's on Hackage), it uses
associated datatypes to allow for a very
general playing-card interface. It was only ever a toy to play w/
Assoc. types for me, but I imagine it
could be a decent starting point for someone interested in turning it
into a real
Don't these things generally get added as LANGUAGE pragmas though? If
it's off by default then peoples code should be okay.
Also, I'd prefer something like `cases` as the keyword, rather than
`case of`, mostly for aesthetics, but also so that, upon visual
inspection, I wouldn't wonder
Given the Shootout results, the difference is a matter of a few
seconds. If Clean Programmers need those few extra seconds, they're
welcome to them.
We're Lazy around here. :)
/Joe
On Nov 4, 2009, at 12:16 AM, Gregory Crosswhite wrote:
So I take it you are saying that it really *cleans*
It's not my fault you emacs-y people chose the wrong editor... :)
/Joe
On Nov 1, 2009, at 11:42 PM, Benjamin L.Russell wrote:
On Fri, 30 Oct 2009 21:38:25 -0700 (PDT), jfred...@gmail.com wrote:
... a new version of
haskell-mode for the lesser of two editors
You may also want to look at Dyre. It does dynamic recompilation of
source files. Depending on your application, hint may not be what you
need. Eg, if you're trying to build something like lambdabot's
interpreter, then Hint is probably on the right track, if you just
want to use
In general? No- If we had an implementation of the `sin` function, how
can testing a finite number of points along it determine
if that implementation is correct for every point?
For specific functions (particularly those with finite domain), it is
possible. If you know the 'correct' output
Really? How? That sounds very interesting, I've got a fair knowledge
of basic topology, I'd love to see an application
to programming...
On Oct 12, 2009, at 1:55 PM, Eugene Kirpichov wrote:
It is possible for functions with compact domain, not just finite.
2009/10/12 Joe Fredette jfred
it on True:undefined and
False:undefined.
2009/10/12 Eugene Kirpichov ekirpic...@gmail.com:
It is possible for functions with compact domain, not just finite.
2009/10/12 Joe Fredette jfred...@gmail.com:
In general? No- If we had an implementation of the `sin` function,
how can
testing a finite number
I completely forgot about free theorems! Do you have some links to
resources -- I tried learning about them a while
ago, but couldn't get a grasp on them... Thanks.
/Joe
On Oct 12, 2009, at 2:00 PM, Dan Piponi wrote:
On Mon, Oct 12, 2009 at 10:42 AM, muad muad.dib.sp...@gmail.com
wrote:
is just continuity in the topological sense.
2009/10/12 Joe Fredette jfred...@gmail.com:
Oh- thanks for the example, I suppose you can disregard my other
message.
I suppose this is a bit like short-circuiting. No?
On Oct 12, 2009, at 1:56 PM, Eugene Kirpichov wrote:
For example
, Ben Franksen wrote:
Joe Fredette wrote:
Really? How? That sounds very interesting, I've got a fair knowledge
of basic topology, I'd love to see an application
to programming...
Compactness is one of the most powerful concepts in mathematics,
because on
the one hand it makes it possible
it harnesses the power of mathematics
that we've been working at for years. Free Theorems indeed!
On Oct 12, 2009, at 4:45 PM, Ben Franksen wrote:
Joe Fredette wrote:
That has got to be the single awesomest thing I have ever seen
ever...
I was dumbfounded, too, when I first read about
a - [a]
is precisely the statement that flatten is a natural transformation
from the Tree functor to the list functor:
fmap_[] g . flatten == flatten . fmap_Tree g
It gets more complicated than this, of course, but that's the basic
idea.
-Brent
On Mon, Oct 12, 2009 at 02:03:11PM -0400, Joe
. flatten == flatten . fmap_Tree g
It gets more complicated than this, of course, but that's the basic
idea.
-Brent
On Mon, Oct 12, 2009 at 02:03:11PM -0400, Joe Fredette wrote:
I completely forgot about free theorems! Do you have some links to
resources -- I tried learning about them a while
ago
I'm happy to tack it on to the sendout, but as others have mentioned,
subscription to haskell-general (to use GManes nomenclature) is
probably the better option. -beginners, iirc, is principally for
questions, not community content. Is this the consensus over there?
I'll do whatever you
2009 09:46:25 -0700 (PDT), Joe Fredette
jfred...@gmail.com wrote:
---
Haskell Weekly News
http://sequence.complete.org/hwn/20091003
Issue 134 - October 03, 2009
The only issue I would have with such a notation is not being able to
visually tell the difference between a monadic function (say, without
a explicit type sig, which is how I write parsers), and an applicative
one.
I'd prefer something like
foo = app
blah blah
If only for some
Sorry, I forgot to actually include the link to the source:
http://lowlymath.net/Iso.hs
/Joe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Let me add to this, as I've used the term DSL without (*gasp*) fully
understanding it before.
In addition to What is a DSL, I'd like to ask:
How is a DSL different from an API? -- in the sense that an API is a
set of, say, combinators to filter email + a monad in which to combine
them. Or
So, if I understand this:
Parsec is a DSL, I'm going to venture it's a Deep embedding -- I
don't understand the internals, but if I were to build something like
Parsec, I would probably build up a Parser datastructure and then
apply optimizations to it, then run it with another function.
A ring is an abelian group in addition, with the added operation (*)
being distributive over addition, and 0 annihilating under
multiplication. (*) is also associative. Rings don't necessarily need
_multiplicative_ id, only _additive_ id. Sometimes Rings w/o ID is
called a Rng (a bit of a
Fischer wrote:
Am Mittwoch 07 Oktober 2009 22:44:19 schrieb Joe Fredette:
A ring is an abelian group in addition, with the added operation (*)
being distributive over addition, and 0 annihilating under
multiplication. (*) is also associative. Rings don't necessarily need
_multiplicative_ id, only
Well, you can drop the arguments entirely, and let the type be
inferred to get
car = head
which is pretty nice. You could use an INLINE hint to make the
compiler replace it before compilation, though I don't think it would
change performance much...
/Joe
On Oct 6, 2009, at 10:01
So, I've been fiddling with an utterly random idea. What if I had a
class:
class Hom a b where
data Rep a b
hm :: Rep a b - b
im :: a - Rep a b
That is, all types that have some conversion between them (an
isomorphism originally, then I thought
Shouldn't the question not be Is this a number? but rather What is
a number? -- I mean, from an abstract point of view, there's really
no such thing, right? We have sets of things which we define an
operation that has certain properties, and suddenly we start calling
them numbers. Are the
---
Haskell Weekly News
http://sequence.complete.org/hwn/20091003
Issue 134 - October 03, 2009
---
Welcome to issue 134 of HWN, a newsletter covering
---
Haskell Weekly News
http://sequence.complete.org/hwn/20091003
Issue 134 - October 03, 2009
---
Welcome to issue 134 of HWN, a newsletter covering
Ah-- so _that's_ why you stopped doing HWN. Moving on to Greener
Pastures...
:) Congrats Brent!
On Oct 1, 2009, at 3:44 PM, Brent Yorgey wrote:
On Thu, Oct 01, 2009 at 04:33:43PM +0200, Wouter Swierstra wrote:
Dear all,
After several years at the helm, I've decided to step down as
Ah-- so _that's_ why you stopped doing HWN. Moving on to Greener
Pastures...
:) Congrats Brent!
On Oct 1, 2009, at 3:44 PM, Brent Yorgey wrote:
On Thu, Oct 01, 2009 at 04:33:43PM +0200, Wouter Swierstra wrote:
Dear all,
After several years at the helm, I've decided to step down as
I think the consensus is Help, not do when it comes to homework
(esp. on -beginners). At least, thats what I try to do. I've always
got the sense that that is what the community expects.
On Sep 28, 2009, at 7:40 PM, Michael P Mossey wrote:
I'm not really hip to the culture here so this is
This week is an experiment, I'm eliminating the mail client from the sendout,
and simply using sendmail directly. If this doesn't fix the line ending problem,
then I'm pretty sure it's a software issue, and not a client issue. If you
notice problems, please email me at this address, put [HWN] in
This week is an experiment, I'm eliminating the mail client from the sendout,
and simply using sendmail directly. If this doesn't fix the line ending problem,
then I'm pretty sure it's a software issue, and not a client issue. If you
notice problems, please email me at this address, put [HWN] in
Trying to work out how to make sendmail do what I want, my computer is
a fickle beast. Also- it should be HWN issue 133. But I'm an idiot,
and just copied the value without thinking.
Someday, when I automate all the uploading/sending to the list
business, this will not be an issue... :/
This week is an experiment, I'm eliminating the mail client from the sendout,
and simply using sendmail directly. If this doesn't fix the line ending problem,
then I'm pretty sure it's a software issue, and not a client issue. If you
notice problems, please email me at this address, put [HWN] in
Trying to work out how to make sendmail do what I want, my computer is
a fickle beast. Also- it should be HWN issue 133. But I'm an idiot,
and just copied the value without thinking.
Someday, when I automate all the uploading/sending to the list
business, this will not be an issue... :/
This week is an experiment, I'm eliminating the mail client from the sendout,
and simply using sendmail directly. If this doesn't fix the line ending problem,
then I'm pretty sure it's a software issue, and not a client issue. If you
notice problems, please email me at this address, put [HWN] in
This week is an experiment, I'm eliminating the mail client from the sendout,
and simply using sendmail directly. If this doesn't fix the line ending problem,
then I'm pretty sure it's a software issue, and not a client issue. If you
notice problems, please email me at this address, put [HWN] in
This week is an experiment, I'm eliminating the mail client from the sendout,
and simply using sendmail directly. If this doesn't fix the line ending problem,
then I'm pretty sure it's a software issue, and not a client issue. If you
notice problems, please email me at this address, put [HWN] in
Ahh, I found the issue. I generated this on the 18th, the software
makes files of the form yearmonthdate.ext, so when Brent
uploaded the hwn for me, the link it generates is to the date it was
generated on, not the date it was published on.
The appropriate link is
I also agree. Hackage should also be renamed to something appropriate.
The Cabbage Patch?
On Sep 20, 2009, at 6:12 PM, Jeff Wheeler wrote:
On Sun, Sep 20, 2009 at 5:11 PM, Jason Dusek jason.du...@gmail.com
wrote:
Some day, we're going to need a short, catchy name for Cabal
packages.
Hopefully the line endings come out okay this week, I did a test
before sending it to the list, please let me know if you notice
anything awry. Just put a [HWN] in the subject line so my filter's
will catch it. /metaeditorial
Hopefully the line endings come out okay this week, I did a test
before sending it to the list, please let me know if you notice
anything awry. Just put a [HWN] in the subject line so my filter's
will catch it. /metaeditorial
Confirmed for me, I actually have no idea who owns C.H.O, but a WHOIS
gives the Yale University Comp. Sci. Dept. Haskell Group as the
registrant, maybe someone over there needs to take a look?
/Joe
On Sep 13, 2009, at 1:17 PM, Neil Mitchell wrote:
Hi,
http://community.haskell.org/ seems
covering developments in
the
[1]Haskell community.
Welcome to issue 130 of HWN! In the last week, HWN has gotten a new
editor, me! I'm Joe Fredette (jfredett on IRC, reddit, and
everywhere
else), and I'll be taking over for Brent (byorgey) from now on. I
think
I speak for the whole
covering developments in
the
[1]Haskell community.
Welcome to issue 130 of HWN! In the last week, HWN has gotten a new
editor, me! I'm Joe Fredette (jfredett on IRC, reddit, and
everywhere
else), and I'll be taking over for Brent (byorgey) from now on. I
think
I speak for the whole
Don't forget about Patch-tag!
Bulat Ziganshin wrote:
Hello Vasili,
Monday, July 20, 2009, 12:26:52 PM, you wrote:
It seems to me that Hackage doesn't provide version control,
e.g. check out and check in. Am I incorrect?
i recommend you to use either codeplex or code.google
If only for the fact that our little Haskell community is composed of
about the nicest set of people ever -- I mean, try asking a newbie
question on #c sometime -- then Haskell is a great language to learn early.
Not only is it great because of it's community, but it's also full of
resources
It's important to note that such a function is not Typeless but rather
Polymorphic -- that is, it is a type which can be satisfied for many
values of it's type variables.
For instance, the function `(+) :: Num a = a - a - a` is polymorphic,
since it's one type variable can be satisfied by any
Code or it didn't happen. :)
Günther Schmidt wrote:
Hi folks,
I would like to announce that I have not merely managed to make the
RTS choke during runtime on stack overflows like lesser programmers,
no, *I* have managed to write code that ghc is not even able to
compile due to exhausting
When Haskell runs it's type checker, it tries to guess the type of
each function. Thats why you can write:
map (+1)
and it knows that you're talking about a function of type:
Num a = [a] - [a]
Another thing, called 'defaulting' resolves this, but you didn't ask
about that, so I won't
The error is because of the way records work in Haskell. Recall that a
record is just sugar for the normal datatype syntax. Namely:
data FooA a b c = FooA {getA :: a, getB:: b, getC :: c}
can be accessed as either
f (FooA a b c) = ...
or
f fooA = ... (getA fooA) ... etc
That is,
While an incredibly small font is a clever option, a more serious
suggestion may be as follows.
3-4 slides imply 3-4 topics, so the question is what are the 3-4 biggest
topics in haskell? I would think they would be:
* Purity/Referential Transparency
* Lazy Evaluation
* Strong Typing + Type
, probably you could fit in an
algebraic datatype and a smallish function over it in pattern-matched
style.
2009/5/18 Joe Fredette jfred...@gmail.com:
While an incredibly small font is a clever option, a more serious suggestion
may be as follows.
3-4 slides imply 3-4 topics, so the question is what
This word has piqued my interest, I've hear it tossed around the
community quite a bit, but never fully understood what it meant. What
exactly is a 'free theorem'?
Eugene Kirpichov wrote:
Hello,
Is there any research on applying free theorems / parametricity to
type systems more complex than
That must have been the vibe I was getting. My haskell-spider senses
were tingling, I just overshot RT and went for the Halting Problem.
/Joe
Brandon S. Allbery KF8NH wrote:
On May 8, 2009, at 01:33 , Joe Fredette wrote:
That strikes me as being bad in a I'm violating the Halting Problem
That strikes me as being bad in a I'm violating the Halting Problem
sort of way- but I'm not sure how. Is there some contradictory
construction that
could be built from such a function?
Nikhil Patil wrote:
Hi,
I am curious to know if there is a function in Haskell to find if a certain
value
We need to start referring to more haskell packages as sexy
/Joe
Jinjing Wang wrote:
Simplest app should look like this
module Main where
import Hack
import Hack.Handler.Kibro
hello :: Application
hello = \env - return $ Response
{ status = 200
, headers
an optimized CPS version of the tree.
HCard -- A library for implementing card-like structures.. Joe Fredette
[22]announced the release of [23]HCard, a library which supports a
card-like data structures and uses associated types to provide
shuffling, dealing, and other facilities. It's
is on Hackage @
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HackMail
Source is on Patch-tag @
http://patch-tag.com/repo/Hackmail
/Joe Fredette
* (I uploaded a little tool called addLicenseInfo to test out the
procedure, so... yah.)
begin:vcard
fn:Joseph Fredette
n:Fredette
, at 11:52 PM, Joe Fredette wrote:
List,
I've got this project, source on patch-tag here[1]
It's a nice little project, I've got the whole thing roughly
working, it compiles okay, everything seems to work, until I try to
run it, specifically when I run it in ghci, or when I run the main
, 2009, at 11:52 PM, Joe Fredette wrote:
List,
I've got this project, source on patch-tag here[1]
It's a nice little project, I've got the whole thing roughly
working, it compiles okay, everything seems to work, until I try to
run it, specifically when I run it in ghci, or when I run the main
You know, I hear theres this brilliant program for compiling C code --
gcd? ccg? gcc, yah gcc... Anyone tried it?
In all seriousness though, why do you need to compile c with ghc? I'm
curious, it seems a bit pointless...
/Joe
Manlio Perillo wrote:
Anton Tayanovskyy ha scritto:
Works for
List,
I've got this project, source on patch-tag here[1]
It's a nice little project, I've got the whole thing roughly working, it
compiles okay, everything seems to work, until I try to run it,
specifically when I run it in ghci, or when I run the main executable
(which uses hint), and look
support types in a package, register it with ghc, link your
application to it, and ask the interpreter to use this package (with a
-package flag).
Hope this helps!
Daniel
On Mar 17, 2009, at 11:52 PM, Joe Fredette wrote:
List,
I've got this project, source on patch-tag here[1]
It's a nice
I believe that hs-plugins has fallen out of use, on #haskell, I was
directed to hint[1]. IIRC, I had to disable some packages because of
cross installation.
/Joe
[1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hint
Yuri Kashnikoff wrote:
Hi!
I was trying to install
As long as one is implementing a CAPTCHA, the reCAPTCHA [1] is my
humble suggestion, I have no idea how the haskellwiki is implemented or
how easy this is to implement, but I imagine it couldn't be _that_ hard.
/Joe
[1] http://recaptcha.net/
Benjamin L.Russell wrote:
On Thu, 12 Mar 2009
Well, there goes any productivity I might have had on my spring break...
Hurrah for old BASIC games!
Lyle Kopnicky wrote:
I am pleased to announce the initial release of Vintage BASIC, an
interpreter for microcomputer-era BASIC. Fully unit-tested, it
faithfully implements the common elements
Hehe, I love it. Sloth is a synonym for Lazyness in English too, and
they're so freaking cute... :)
Maurício wrote:
Hi,
Here in Brazil we have a forest animal we name 'preguiça' -- literally,
lazyness. What better mascot we could have for Haskell? It lives (and
sleeps) in trees, and if you
98 matches
Mail list logo
