I do not know of a specific definition, but I think the heuristic for
inclusion in Data is that which is neither control nor chaos.
By 'control' I mean functions that are often "baked into" other languages,
such as exception handling, bracketing, but which can be implemented as
library functions i
On Sun, Dec 14, 2008 at 6:27 PM, Don Stewart wrote:
>
> Could you attach it to the web page,
>
>http://haskell.org/haskellwiki/Haskell_logos/New_logo_ideas
>
>
I tossed up a quickie candidate there as well.
___
Haskell-Cafe mailing list
Haskell-Cafe
On Thu, Aug 21, 2008 at 11:19 AM, Don Stewart <[EMAIL PROTECTED]> wrote
>
>
>
> Can the Debian/Haskell interest parties say something about
> who's doing what in this area? Is there hope for a concrete
> effort to import large numbers of hackage apps and tools into Debian?
I made a stab at it, b
On Tue, May 27, 2008 at 10:27 PM, Benjamin L. Russell <
[EMAIL PROTECTED]> wrote:
> Actually, according to the definition that you used (
> http://www.merriam-webster.com/dictionary/cabal), there are the following
> two pronunciations of "cabal":
>
> 1) \kə-ˈbäl\
> 2) \kə-ˈbal\
>
> The "a" phoneme
As in the dictionary (http://www.merriam-webster.com/dictionary/cabal),
accent on the second syllable, which is pronounced like none of ball,
balance, boll and bale. Roughly the same rhythm as kaboom.
On Tue, May 27, 2008 at 6:04 PM, Dan Piponi <[EMAIL PROTECTED]> wrote:
> In particular, which s
ICFP 2007 introduced a new category of paper called an "Experience Report",
which is not required to add to the body of research knowledge, but rather
report on the effectiveness of functional tools and methods in full-scale
projects. You can read the official description in the call for papers:
h
No, I cannot reproduce this.
2008/2/4 David Fox <[EMAIL PROTECTED]>:
> I'm seeing the character ^D inserted into argument strings that are about
> 256 characters long with GHC 6.8.2. Anyone else?
>
> Test.hs:
>
> module Main where
>
> import System.Environment
> import System.IO
>
> main =
>
On Jan 24, 2008 3:55 PM, PR Stanley <[EMAIL PROTECTED]> wrote:
> Hi
> What does the list think of EC? Genetic algorithm is apparently the
> latest thing.
They've been around for a while, actually. See below for some work from the
early 1990's.
> Is EC mathematically reasonable?
I'm not sure
It well might. I believe you can do this yourself. Jeremy Shaw wrote a
parser for Debian control files, which was useless on the really large
package index files. He switched it over to using bytestrings and that
solved the problem. You can find the code in a darcs repository at:
http://src.see
2008/1/18 Sukit Tretriluxana <[EMAIL PROTECTED]>:
> Hi,
>
> I don't know if it's been asked before. I just wonder if GHC supports some
> sort of one-liner program that can be specify right as the argument to
> either ghci or runghc program. In perl, they have something like
>
> perl *-e* 'print "H
A comment on documentation. I find it very frustrating when libraries are
described as an interface to X, where X is often an acronym that has
multiple definitions on the web. Lots of clicking got me to 'Music Player
Demon', but no further description or links. Just a little more
information, sa
Use:
import Prelude ()
On Jan 10, 2008 11:22 AM, Maurício <[EMAIL PROTECTED]> wrote:
> Hi,
>
> Is it possible not to load Prelude module
> when compiling a Haskell module? Or instruct
> ghc to "unload" it?
>
> Thanks,
> Maurício
>
> ___
> Haskell-Caf
Donald Bruce Stewart wrote:
I've always thought that the obfuscation opportunities for Num
literal overloading, combined with Num *overflowing* were
underappreciated.
Search for 'mel blackjack'. You and Mel would get along fine.
___
Haskell-Cafe
Scott Cruzen wrote:
I'd like to suggest the Mantis shrimp because they have excellent
vision, they're long lived and they pack a punch.
They certainly do. An excellent choice.
Personally, I'd like to see the Giant Sea Bass., just because they're so
stately:
http://week.divebums.com/2
Seth Gordon wrote:
I think a more powerful argument would be to talk about cases where
Haskell is *actually being used* industrially. E.g., "these folks at
Credit Suisse are using Haskell for their analytics because in their
line of work, if the implementation of the code doesn't match up
perfec
Donald Bruce Stewart wrote:
david:
Ah... so the secret is in the hidden variables. On some
level I am beginning to fear that Monads resurrect some of
the scariest aspects of method overriding from my OO
programming days. Do you (all) ever find that the ever
changing nature of
Jeremy Shaw wrote:
I noticed that the results can be a bit suprising sometimes. See if
you can predict the answers to these (in ghci):
Interesting examples. Here's another one that I would find problematic:
*SameType> same Nothing (Just "xyzzy")
False
*SameType> same (Nothing ::
Nicolas Frisby wrote:
http://www.thinkgeek.com/geektoys/cubegoodies/86b8/
Now you can really show your coders why unsafePerformIO is to be avoided!
On the contrary, seems like a little more non-determinism would really
make that thing into an effective weapon. ;-)
__
I don't suppose anyone has any Haskell code that understands the PDF
format, do they?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Kirsten Chevalier wrote:
There's also excellent Haskell documentation available on the web
already, but people like to buy books and they like to have an
artifact that they can hold in their hands without getting laser
printer toner all over themselves.
It also helps to collect and edit. Wik
John Goerzen wrote:
Quick feedback time...
One comment people made in the Future of MissingH thread was that the name
isn't very suggestive of what the library does.
My colleague uses modules called `My' to hold functions that seem like
they should be in a library, but which aren't yet matur
Udo Stenzel wrote:
jim burton wrote:
I want to split a string into 5 parts of equal length, with the last fifth
padded if necessary, but can't get it right - here's what I've got -
fifths s = unwords.take 5.unfoldr (Just . splitAt l) $ s ++ repeat ' '
where l = (leng
Vraj Mohan wrote:
This works for several examples that I tried out but goes into an infinite loop
for my_sqrt 96. How do I go about debugging this code in GHC or Hugs?
(The equivalent code is well-behaved on MIT Scheme)
There was some excellent advice in the other responses, but I thought
Neil Mitchell wrote:
Just as a warning, I've been offline without a computer for a week,
and have now entirely redesigned pretty much every aspect of Hoogle 3
in preparation for Hoogle 4. Its all on paper for now, but in the very
near future Hoogle will get completely rewritten :)
Excellent.
Neil Mitchell wrote:
If you download and compile hoogle from the darcs repo, there is a
console version included. Of course, lambdabot gives you lots more
than just hoogle, so might still be the one for you.
I've been avoiding that, because there are too many things I'm tempted
to fiddle with
Nicolas Frisby wrote:
I would quite appreciate the type info at edit time (especially when
tracking down errors) but as far as I know VisualStudio is a 100%
Windows only app (right?). I don't run Windows.
Is there anything similar to VisualHaskell that works in light-weight
(compared to Studio..
Stephane Bortzmeyer wrote:
[It is a philosophical question, not a practical programming problem.]
I'm used, in imperative programming languages with exceptions (like
Python) to call any function without fear of stopping the program
because I can always catch the exceptions with things like (Pyth
Duncan Coutts wrote:
On Thu, 2006-06-15 at 13:11 +0100, Duncan Coutts wrote:
then you can construct your records using:
foo = default { weight = 3.2 }
Oops, as David House pointed out to me that should of course be
foo = default { weight = Just 3.2 }
I think the c
Donn Cave wrote:
Quoth Clifford Beshers <[EMAIL PROTECTED]>:
| Well, I couldn't resist the puzzle. Here are solutions using foldr and
| unfoldr. Don't know if they are cunning or not, but they were kind of fun.
...
| splitByElem1 e xs =
| foldr f [[]] xs
| where f
Well, I couldn't resist the puzzle. Here are solutions using foldr and
unfoldr. Don't know if they are cunning or not, but they were kind of fun.
import Data.List
splitByElem e xs =
unfoldr f xs
where f s =
case break (e ==) s of
("",_) -> Nothing
(a,b) ->
Brandon Moore wrote:
Going by man grep, those [:foo:] classes are only special inside a
character class, otherwise [:space:]* = [aceps:]*.
Prelude Text.Regex> splitRegex (mkRegex "[[:space:]]*,[[:space:]]*")
"Haskell, Haskell, and Haskell"
["Haskell","Haskell","and Haskell"]
The smart
Sara Kenedy wrote:
Hi all,
I want to write a function to separate a string into a list of strings
separated by commas.
Example:
separate :: String -> [String]
separate "Haskell, Haskell, and Haskell" = ["Haskell", "Haskell", "and
Haskell"]
If anyone has some ideas,
The Wikipedia article on lambda abstractions
(http://en.wikipedia.org/wiki/Lambda_abstraction) has a statement that
does not resonate with me:
A lambda abstraction is to a functional programming language
such as Scheme what pseudo-code
is to an imperative programming language.
Does anyone else
John Meacham wrote:
On Fri, Jun 09, 2006 at 02:16:47AM -0700, Clifford Beshers wrote:
Interesting. I just gave a talk to the SGVLUG (San Gabriel Valley Linux
Users Group, which is centered at Cal Tech). It was the first time I've
given such a talk, half about Lin
Tracy R Reed wrote:
Jared Updike wrote:
I was always impressed with Autrijus Tang's presentation here:
http://www.pugscode.org/euroscon/haskell.xul (view with Firefox
or other Gecko-based browser)
Unfortunately, this presentation alone is incomprehensible to som
ihope wrote:
How would I keep the "Foo!" from conflicting with the "Lorem ipsum
dolor sit amet."?
Well, if two millennia were not enough, I'm not sure any amount of
Haskell will help.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www
ies and tools that he would be interested in includng in the
Debian archive. Also, it seems there are quite a few other libraries
out there which are either not debianized or stale. We are looking into
helping the folks on the debian-haskell list with that, if possible,
documenting and automating w
37 matches
Mail list logo