Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Integer arithmetic: mod
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2001-08-10 (22:31)
From: Kai Kaminski <kok@w...>
Subject: Re: [Caml-list] Integer arithmetic: mod
On Mon, Aug 06, 2001 at 11:10:00AM +0200, Xavier Leroy wrote:
> > Haskell has both: div & mod truncate downwards, quot & rem truncate
> > towards 0.
> So does Ada, I think.  It's probably a good idea to have two sets of
> operators, and document that one of them (those that truncate downwards)
> is a bit less efficient.
I agree. Is there a chance that this will really happen in a future
release of OCaml? Is there a roadmap for OCaml-development?

Kai Kaminski
Bug reports:  FAQ:
To unsubscribe, mail  Archives: