Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] Evaluation Order
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: David McClain <dmcclain1@m...>
Subject: Re: [Caml-list] Evaluation Order
> It sounds like a lot of what you're describing comes with Haskell's
> monadic IO system.  If you have an expression
>
>   e1 +  e2
>
> where e1 and e2 could be side effecting expressions, the type system
> forces you to write:
>
> do v1 <- e1
>    v2 <- e2
>    return v1 + v2
>

Hmm... Monads have been mentioned several times now. I need to go back and
refresh my understanding of these. I seem to recall that Marcus Motl did
something in OCaml related to monadic programming idioms. I am aware, now
that you mention it, that Haskell does have these temporal ordering
constraints available. It would be very nice to have these in a language
like OCaml with its easy integration of foreign functions.

- DM


-------------------
Bug reports: http://caml.inria.fr/bin/caml-bugs  FAQ: http://caml.inria.fr/FAQ/
To unsubscribe, mail caml-list-request@inria.fr  Archives: http://caml.inria.fr