Jón Fairbairn wrote (to the Haskell mailing list):
> pi1_3 or proj1_3 or select_1_3 or sel_1_3, even s_1_3 -- omitting the
> "_" means sel is ambiguous (!). We should choose a scheme that can
> cope with such things even if they are unlikely.
> I don't think pi_m_n looks right unless you re
> > As Haskell has the standard functions fst, snd to decompose (a,b),
> > maybe, it worths to provide also
> > tuple31, tuple31, tuple31,
> > ...
> > tuple51, tuple52, tuple53, tuple54, tuple55
> >
On 16 Sep, Keith Wansbrough wrote:
> I suggest calling them "pi13" or "prj13" rather than "tuple31", though.
pi1_3 or proj1_3 or select_1_3 or sel_1_3, even s_1_3 -- omitting the
"_" means sel is ambiguous (!). We should choose a scheme that can
cope with such things even if they are unlikel
Dear Haskell users and developers,
I announce that manual.txt from the archive
ftp.botik.ru:/pub/local/Mechveliani/docon/2/docon-2.zip
http://www.botik.ru...
contains the section
--
{lne}
Moore Paul <[EMAIL PROTECTED]> writes
> [..]
> fact1 1 = 1
> fact1 n = n * fact1 (n-1)
>
> factsupp 1 a = a
> factsupp n a = factsupp (n-1) (a*n)
>
> fact2 n = factsupp n 1
>
> where fact1 has to be recursive, but fact2 can be expected to run in
> constant space. For example, Scheme
As Haskell has the standard functions fst, snd to decompose (a,b),
maybe, it worths to provide also
tuple31, tuple31, tuple31,
...
tuple51, tuple52, tuple53, tuple54, tuple55
for the tuples of n = 3,4,5 ?
-
Thanks again for your help with the previous question. I have another
one. (If there is a more appropriate forum for simple questions like
this, please let me know; I don't want to waste your time.)
I am confused about the rules for constraints on polymorphic classes.
Suppose I write a class in
Congratulations to LA & Si^3 !
Just curious, a few questions :
- How long was your program?
- How did you do the parsing? with happy?
parser combinators? ...
- Which compiler did you use ? (Okay, i think i know ... :-))
- Other information you want to share with us ...
(eg. - which optimization
> As Haskell has the standard functions fst, snd to decompose (a,b),
> maybe, it worths to provide also
> tuple31, tuple31, tuple31,
> ...
> tuple51, tuple52, tuple53, tuple54, tuple55
>
> for the tuples of n = 3,4,
Lars Lundgren writes:
> [EMAIL PROTECTED] writes:
>
> > the problem of doing stateful things and IO at the same time. Eventually I
> > realised it is not possible to nest monads,
>
> But it is possible! You just need to use a monadtransformer:
>
> class MonadTrans t where
> lift :: Monad m =
On Thu, 16 Sep 1999, Lars Lundgren wrote:
[snip]
> myProg:: StateMT IO Int
> myProg = return 5
>
> main = do n <- runSMT myProg
> print n
>
I forgot to show something interesting in my first example, try this
instead:
myProg:: StateMT IO Int
myProg = do lift $ putStrLn "HelloWorld!"
On Wed, 15 Sep 1999 [EMAIL PROTECTED] wrote:
>
> * stToIO . This is often necessary for programs that do stateful things as well
> as IO. A few years ago, having read all relevant papers, I was very perplexed by
> the problem of doing stateful things and IO at the same time. Eventually I
> reali
The proceedings of WAAAPL (Workshop on Algorithmic
Aspects of Advaced Programming Languages) is now
available electronically. WAAAPL will be held
in Paris on September 30--between ICFP and
the Haskell Workshop.
The entire proceedings is at
http://www.cs.columbia.edu/~cdo/waaapl99.pdf
The prog
| As Haskell has the standard functions fst, snd to decompose (a,b),
| maybe, it worths to provide also
| tuple31, tuple31, tuple31,
| ...
| tuple51, tuple52, tuple53, tuple54, tuple55
|
| for the tuples of n = 3,4,
| > * stToIO . This is often necessary for programs that do
| > stateful things as well as IO. A few years ago, having read
| > all relevant papers, I was very perplexed by the problem of
| > doing stateful things and IO at the same time. Eventually I
| > realised it is not possible to n
15 matches
Mail list logo
