On Tue, 5 Sep 2000 12:33:47 +0200 (MET DST) "Ch. A. Herrmann"
<[EMAIL PROTECTED]> wrote:
> Hi Diego,
>
> > "Diego" == Diego Dainese <[EMAIL PROTECTED]> writes:
>
> Diego> - In Haskell is there some way to combine IO and ST?
>
> there is a so-called IOS-Monad combining IO and State, app
05 Sep 2000 12:05:29 +0200, Diego Dainese <[EMAIL PROTECTED]> pisze:
> - In Haskell is there some way to combine IO and ST?
In GHC and Hugs there are IORef, IOArray, readIORef etc. which
give ST's functionality in IO. There is also stToIO and even
unsafeIOtoST. In newer GHCs there is a MArray mo
Hi Diego,
> "Diego" == Diego Dainese <[EMAIL PROTECTED]> writes:
Diego> - In Haskell is there some way to combine IO and ST?
there is a so-called IOS-Monad combining IO and State, appended below.
Thanks to John O'Donnell who told me about it and gave it to me a few weeks ago.
Cheers
C
> - Are there other interesting Monads or Combined Monads to consider?
see
Mark P. Jones and Luc Duponcheel: Composing Monads
Research Report YALEU/DCS/RR-1004, Yale University, New
Haven, Connecticut, USA, December 1993.
http://www.cse.ogi.edu/~mpj/pubs/composing.html
--
-- Johannes Waldman
Hi all,
I'm new to Haskell, and I've found its approach to imperative
programming (monad) quite interesting; but there are some problems
with this, partly already mentioned by Philip Wadler in his paper "How
to Declare an Imperative": using his words, there no way to move
smoothly from no monad (
> > 2. I would first like to come back to the type signature
> >
> >f :: a -> b
> >
> > I can say the type of f is a -> b , isn't it?
>
> Well, people often do say that, but it is a little sloppy; if you want
> to be precise, it is more correc
On 27-Mar-2000, Jan Brosius <[EMAIL PROTECTED]> wrote:
> 1. In Haskell there are 2 sorts of variables : variables that range over values of
>a specific type and "type variables".
>
> e.g.in fact n = n * fact (n - 1) (the factorial function n ranges over the values
>of type Int.
>
> and in
Many thanks for answering my questions.
Actually, I am studiyng the paper
lazy functional state threads
in order to understand the runST function. That's where the type "State" comes from.
I have given a course in logic at the university of Burundi with mathematical set
theory as
On 27-Mar-2000, Jan Brosius <[EMAIL PROTECTED]> wrote:
> Hi,
>
> Suppose a denotes a type variable.
>
> 1.Can I then say: Bool is of type a ?
No. That would be a category error. `Bool' _is a_ type, but it doesn't
_have a_ type.
Only _values_ have types, but `Bool' is a type, not a v
Hi,
Suppose a denotes a type variable.
1.Can I then say: Bool is of type a ?
2. I suppose I can say that True is of type Bool. However True is not
itself a type, isn't it?
I suppose that I cannot say that True is of type a, isn't it ? So True is a
10 matches
Mail list logo
