Joel Reymont <[EMAIL PROTECTED]> writes:
> I think that developing HTML scrapers requires short tweak-compile- run
> cycles and is probably best done in Perl, Python, Ruby, i.e. dynamic
> languages but I wonder if someone has found otherwise.
I get very short tweak-run cycles from haskell-mode i
Hi
On 6/19/06, Sara Kenedy <[EMAIL PROTECTED]> wrote:
> Hello,
>
> I want to creat a function sumList as below examples:
> sumList [("s1",2),("s2",4),("s3",3),("s4",2)] = ("#", 1/2 + 1/4 + 1/3 + 1/2)
> sumList [("s1",2),("s2",4),("s3",3) = ("#", 1/2 + 1/4 + 1/3)
>
> I attempted it as following:
>
Here's a puzzle I haven't been able to solve. Is it possible to write the
initlast function?
There are functions "init" and "last" that take constant stack space and
traverse the list at most once. You can think of traversing the list as
deconstructing all the (:) [] constructors in list.
On Jun 19, 2006, at 11:24 AM, C Rodrigues wrote:
Here's a puzzle I haven't been able to solve. Is it possible to
write the initlast function?
There are functions "init" and "last" that take constant stack
space and traverse the list at most once. You can think of
traversing the list as
On 2006-06-19 at 15:24- "C Rodrigues" wrote:
> Here's a puzzle I haven't been able to solve. Is it possible to write the
> initlast function?
>
> There are functions "init" and "last" that take constant stack space and
> traverse the list at most once. You can think of traversing the list
On Mon, 2006-06-19 at 15:24 +, C Rodrigues wrote:
> Here's a puzzle I haven't been able to solve. Is it possible to write the
> initlast function?
>
> There are functions "init" and "last" that take constant stack space and
> traverse the list at most once. You can think of traversing the
On Jun 19, 2006, at 11:24 AM, C Rodrigues wrote:
Here's a puzzle I haven't been able to solve. Is it possible to
write the initlast function?
There are functions "init" and "last" that take constant stack space
and traverse the list at most once. You can think of traversing the
list a
Where's the solution and what is the repmin problem?
On Jun 19, 2006, at 5:21 PM, Jerzy Karczmarczuk wrote:
Such tricks become your second nature, when you take the solution
(lazy) of the "repmin" problem by Richard Bird, you put it under your
pillow, and sleep for one week with your head close
On Mon, 2006-06-19 at 17:03 +0100, Jon Fairbairn wrote:
> On 2006-06-19 at 15:24- "C Rodrigues" wrote:
> > Here's a puzzle I haven't been able to solve. Is it possible to write the
> > initlast function?
> >
> > There are functions "init" and "last" that take constant stack space and
> > tr
On Jun 19, 2006, at 12:50 PM, Duncan Coutts wrote:
On Mon, 2006-06-19 at 17:03 +0100, Jon Fairbairn wrote:
On 2006-06-19 at 15:24- "C Rodrigues" wrote:
Here's a puzzle I haven't been able to solve. Is it possible to
write the
initlast function?
There are functions "init" and "last" th
Joel Reymont writes:
Where's the solution and what is the repmin problem?
On Jun 19, 2006, at 5:21 PM, Jerzy Karczmarczuk wrote:
Such tricks become your second nature, when you take the solution
(lazy) of the "repmin" problem by Richard Bird, you put it under your
pillow, and sleep for one we
Hello,
Can somebody help me
My Problem is to define a code for:
>cross 7 -- means 7*7
>+++
>++ ++
>+ + + +
>+++
>+ + + +
>++ ++
>+++
Another Example
>cross 13 -- 13*13
>+
>++ ++
>+ +
Hi all,
Can somebody help me
My Problem is to define a code for:
cross 7 -- means 7*7
+++
++ ++
+ + + +
+++
+ + + +
++ ++
+++
Not to be the bad guy, but perhaps it's a good idea to remind
ourselves of our homework policy.
Regards,
Stefan
___
Not to be the bad guy, but perhaps it's a good idea to remind
ourselves of our homework policy.
This?
http://www.haskell.org/hawiki/HomeworkHelp
Can I use putString ???
If you mean putStrLn and putStr, then yes. I would first make a
function that constructs the string or list of strings (m
David Roundy wrote:
On Fri, Jun 02, 2006 at 12:34:51PM +1000, Donald Bruce Stewart wrote:
dons:
briqueabraque:
Hi,
I need to edit big text files (5 to 500 Mb). But I just need to
change one or two small lines, and save it. What is the best way to do
that in Haskell, without creating co
I'd like to use a tool to automatically install Haskell XML Toolkit and its dependencies. What are my options? How's cabal-get coming?Thanks,Greg
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Ah, thanks for the replies. I like the approach that uses lazy tuples of
intermediate values because it has a recognizable similarity to the original
two functions.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailma
Here's a code fragment I have from working with Hal Daume's "Yet Another
Haskell Tutorial". I cannot figure out how to iterate over the result
from askForNumbers that returns "IO [Integer]", and print them.
The "<-" operator seems to take IO off of the results from actions like
getContents, which
On 6/20/06, Taro Ikai <[EMAIL PROTECTED]> wrote:
Here's a code fragment I have from working with Hal Daume's "Yet Another
Haskell Tutorial". I cannot figure out how to iterate over the result
from askForNumbers that returns "IO [Integer]", and print them.
The "<-" operator seems to take IO off o
Sebastian,
Thanks for your help. I learned two things:
o show is not an action, but a function. Using it in the interactive
mode of GHCI was making me confused.
o To output anything, I need to do 'do'.
-Taro
Sebastian Sylvan wrote:
On 6/20/06, Taro Ikai <[EMAIL PROTECTED]> wrote:
Here's
o To output anything, I need to do 'do'.
If you only have one action, you can omit do, e.g.
main = do { putStrLn "Hello, World!" }
is identical (after de-sguaring) to
main = putStrLn "Hello, World!"
Essentially, you are correct; to output anything (i.e. to perform I/O
by side effect) your
21 matches
Mail list logo
