I'm running cygwin on WinXP and got a different failure (below) from the
latest darcs hs-plugins. Line 11 is right after the TOP definition. Does
anyone have a theory about what's going on here? - Conal
looks like the TOP and GHC_LIB_PATH values are the output of external
commands, such as
-- i've added crossposts to John Meacham and Einar Karttunen because
-- you also denoted interest in new i/o library
Hello Neil,
Friday, March 9, 2007, 9:12:31 PM, you wrote:
I note that the deadline for discussion of System.FilePath has now passed
(well,
a long time ago :-), so it looks
Hi,
some more ideas following from the last post. I noticed how the function
Data.Maybe.maybe converts a Haskell Maybe into a Church encoded Maybe.
Also, the if construct, interpreted as a function, converts a Bool into
a church encoded Bool.
If lists are encoded as forall b. (a - b - b) - b -
Hello haskell-cafe,
Page http://community.livejournal.com/ru_lambda/44716.html
contains three very simple but long-working benchmark functions:
dummy :: [Int] - [Int]
dummy [] = []
dummy (x:xs) = x:dummy (dummy xs)
dummy2 :: [Int] - [Int]
dummy2 = dum []
where
dum w [] = w
dum
Hello Claus,
Saturday, March 10, 2007, 4:36:22 AM, you wrote:
ah, ok, i'm not used to thinking in such scales;-) (perhaps you should get in
touch
with those SAC people, after all - i don't know what their state of play is,
but
many years ago, they started in an office near mine, and they
On Sat, Mar 10, 2007 at 03:43:41PM +0100, Joachim Breitner wrote:
Hi,
some more ideas following from the last post. I noticed how the function
Data.Maybe.maybe converts a Haskell Maybe into a Church encoded Maybe.
Also, the if construct, interpreted as a function, converts a Bool into
a
On Saturday 10 March 2007 09:43, Joachim Breitner wrote:
Hi,
some more ideas following from the last post. I noticed how the function
Data.Maybe.maybe converts a Haskell Maybe into a Church encoded Maybe.
Also, the if construct, interpreted as a function, converts a Bool into
a church
On Sat, Mar 10, 2007 at 03:43:41PM +0100, Joachim Breitner wrote:
Hi,
some more ideas following from the last post. I noticed how the function
Data.Maybe.maybe converts a Haskell Maybe into a Church encoded Maybe.
Also, the if construct, interpreted as a function, converts a Bool into
a
Bulat Ziganshin wrote:
-- i've added crossposts to John Meacham and Einar Karttunen because
-- you also denoted interest in new i/o library
Me, too :-)
just a couple of
ideas:
- portable async i/o which is able to work via select/epoll/...
I think you mean non-blocking I/O here, right?
On 10/03/07, Joachim Breitner [EMAIL PROTECTED] wrote:
Is there a name for these functions? Characteristic Church Encoding
Functions maybe? Are there more than these:
Catamorphisms is indeed the name I've heard.
--
-David House, [EMAIL PROTECTED]
cat foo.lhs | grep -e ^ | sed s/^ //
Running for the Useless Use of cat Award?
A simpler version would be:
sed -n -e 's/^//p foo.lhs
I don't guarantee that this will work correctly, tho. Maybe
sed -n -e 's/^ //p foo.lhs
will work better? This said, the OP talked about TeX, so
I'm pretty sure you can define a catamorphism for any regular algebraic
data type.
Actually, so-called negative occurrences in (regular) data types cause
problems. Try to define the catamorphism of
data Exp = Num Int | Lam (Exp - Exp) | App Exp Exp
to see the problem,
Stefan
My apologies if this is a question with a trivial answer.
Command line args in C are accessed via argc and argv[]
defined as arguments to main();.
How are command line arguments to a ghc-compiled program
accessed in Haskell? Or is that even possible?
Thanks.
bulat.ziganshin:
Hello Claus,
Saturday, March 10, 2007, 4:36:22 AM, you wrote:
ah, ok, i'm not used to thinking in such scales;-) (perhaps you should get
in touch
with those SAC people, after all - i don't know what their state of play
is, but
many years ago, they started in an
On Mar 10, 2007, at 20:46 , [EMAIL PROTECTED], [EMAIL PROTECTED] wrote:
My apologies if this is a question with a trivial answer.
Command line args in C are accessed via argc and argv[]
defined as arguments to main();.
How are command line arguments to a ghc-compiled program
accessed in
Dave:
My apologies if this is a question with a trivial answer.
Command line args in C are accessed via argc and argv[]
defined as arguments to main();.
How are command line arguments to a ghc-compiled program
accessed in Haskell? Or is that even possible?
Simplest:
bulat.ziganshin:
Hello haskell-cafe,
Page http://community.livejournal.com/ru_lambda/44716.html
contains three very simple but long-working benchmark functions:
dummy :: [Int] - [Int]
dummy [] = []
dummy (x:xs) = x:dummy (dummy xs)
dummy2 :: [Int] - [Int]
dummy2 = dum []
where
17 matches
Mail list logo
