bulat.ziganshin:
> Hello Donald,
>
> Wednesday, February 14, 2007, 1:51:26 AM, you wrote:
> > 7 were successful, 2 were unsuccessful.
>
> can you please name successful projects and their download pages?
Most of the projects have been hosted on darcs.haskell.org since the beginning,
and student
G'day all.
Quoting Dougal Stanton <[EMAIL PROTECTED]>:
> Is there a better way to turn an integer N and a list of primes
> [p1,p2,p3,...] into powers [c1,c2,c3,...] such that
>
> N = product [p1^c1, p2^c2, p3^c3, ...]
It depends what you mean by "better".
You can make it more concise by using z
On 2/14/07, Klaus Ostermann <[EMAIL PROTECTED]> wrote:
in structural operational semantics, an evaluation context is often used to
decompose an expression into a redex and its context.
Have you seen
http://citeseer.ist.psu.edu/mcbride01derivative.html
The Derivative of a Regular Type is its T
magnus:
> I'm curious, why doesn't Data.ByteString.Lazy.Char8 have the functions
> for searching for substrings that Data.ByteString.Char8 has (isPrefixOf,
> isSuffixOf, isSubstringOf, findSubstring and findSubstrings)?
>
Sorry for the delay.
The reason they're missing is that no one implemented
Hi there,
in structural operational semantics, an evaluation context is often used to
decompose an expression into a redex and its context. In a formal semantics on
paper, an expression can just be "pattern matched" over the grammar of an
evaluation context. If one wants to implement such a se
BlobXmlRpc.hs:36:19: parse error on input `$'
make: *** [BlobXmlRpc] Error 1
2007/2/15, Bjorn Bringert <[EMAIL PROTECTED]>:
On Feb 14, 2007, at 22:50 , keepbal wrote:
> http://www.cs.chalmers.se/~bringert/darcs/blob/Makefile
>
> BlobXmlRpc: GHCFLAGS += -package XmlRpc
>
> I can't find XmlRpc,
On Feb 14, 2007, at 22:50 , keepbal wrote:
http://www.cs.chalmers.se/~bringert/darcs/blob/Makefile
BlobXmlRpc: GHCFLAGS += -package XmlRpc
I can't find XmlRpc,so I use haxr instead,but it doesn't work.
haxr is the new name for the XmlRpc package, so changing -package
XmlRpc to -package hax
http://www.cs.chalmers.se/~bringert/darcs/blob/Makefile
BlobXmlRpc: GHCFLAGS += -package XmlRpc
I can't find XmlRpc,so I use haxr instead,but it doesn't work.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinf
Dougal Stanton wrote:
So which one of you wonderful people volunteered to give a talk on
Haskell at the coming LugRadio Live? I'm afraid I didn't catch the name,
though it might have been a Magnus something?
It might be enough to make me go if I knew there would be some funky
Haskelling going
On 2/14/07, Stephane Bortzmeyer <[EMAIL PROTECTED]> wrote:
http://www.krugle.com/
Unlike Google, you can specify Haskell as a language.
It is true that you can't directly specify the programming language
with Google. But you can specify the filetype, i.e. hs or lhs, with
Google.
To do this, j
So which one of you wonderful people volunteered to give a talk on
Haskell at the coming LugRadio Live? I'm afraid I didn't catch the name,
though it might have been a Magnus something?
It might be enough to make me go if I knew there would be some funky
Haskelling going on.
Cheers,
D.
--
Bjorn Bringert-2 wrote:
>
>
> Use the time package (Data.Time.*). time-1.0 is in GHC 6.6 extralibs,
> and available from Hackage
> (http://hackage.haskell.org/cgi-bin/hackage-scripts/package/time-1.0)
> and the development version lives at
> http://darcs.haskell.org/packages/time/
>
>
Tha
On 14/02/07, Stephane Bortzmeyer <[EMAIL PROTECTED]> wrote:
http://www.krugle.com/
Nice :-)
Unlike Google, you can specify Haskell as a language.
Google CodeSearch is pretty handy though:
http://www.google.com/codesearch?q=lang%3Ahaskell
it seems to return code with good relevence, and ca
Using printf doesn't need Haskell'. I wrote to require only Haskell98.
-- Lennart
On Feb 14, 2007, at 11:36 , Neil Mitchell wrote:
Hi
Eeek, a solution that does monadic maps and require's rank 2 types!
arr = [('a',1), ('b',2), ('c',3)]
showAll = lines (map showItem arr)
showItem (a
http://www.krugle.com/
Unlike Google, you can specify Haskell as a language.
But the very useful (and, again, unlike Google) parsing service, which
allows you to specify that you search "foldl" only in function calls,
not function definitions, seems broken for Haskell ("map" is never
found in fun
Hi Don,
Type :? for help
Hugs.Base> :l Text.Printf
Text.Printf> printf "%d" (1::Int) :: String
"1"
My bad - sorry, too many presentations/papers were people encoded
printf using multi-ranked-generalised-associated types :)
Fix Yhc!
Fair point, should be as simple as compiling that file...
ndmitchell:
> Hi
>
> Eeek, a solution that does monadic maps and require's rank 2 types!
>
> arr = [('a',1), ('b',2), ('c',3)]
> showAll = lines (map showItem arr)
> showItem (a,n) = a : " = " ++ show n
> main = putStr showAll
>
> I've broken this up a bit more than usual - most people would pro
Hi
Eeek, a solution that does monadic maps and require's rank 2 types!
arr = [('a',1), ('b',2), ('c',3)]
showAll = lines (map showItem arr)
showItem (a,n) = a : " = " ++ show n
main = putStr showAll
I've broken this up a bit more than usual - most people would probably
just put showAll inside m
Hello Donald,
Wednesday, February 14, 2007, 1:51:26 AM, you wrote:
> 7 were successful, 2 were unsuccessful.
can you please name successful projects and their download pages?
--
Best regards,
Bulatmailto:[EMAIL PROTECTED]
__
Gracjan Polak wrote:
Bjorn Bringert cs.chalmers.se> writes:
Is there a description what is a *CGI* protocol?
Here you go: http://hoohoo.ncsa.uiuc.edu/cgi/interface.html
I should be more clear: what kind of data does pwrapper expect? Somewhere in the
middle it needs two handles: one to write
On Tue, 2007-02-13 at 22:43 -0500, Jefferson Heard wrote:
> It was suggested that I might derive some performance benefit from using lazy
> bytestrings in my tokenizer instead of regular strings. Here's the code that
> I've tried. Note that I've hacked the "basic" wrapper code in the Lazy
> ve
On a related topic, I think Duncan Coutts and Lennart Kolmodin have
worked on adding ByteString support to Alex. It seems to be available in
the current darcs version of Alex. You many want to check with them for
more details.
/Björn
Jefferson Heard wrote:
It was suggested that I might derive
22 matches
Mail list logo
