On Fri, 2014-07-11 at 18:08 +0100, Brian Drummond wrote: > On Fri, 2014-07-11 at 18:41 +0200, tgingold@free.fr wrote: > > > But if we are providing boolean and shift operators for the special > > > case of modulo 2**n, then we have to do one of: > > > 2) Define boolean and shift only for mod 2**n and prohibit for other > > > cases. Ugly irregular language feature. IMO : No. > > Strongly in favour of 2) after the Ada experience. > > I'm interested : what about the Ada logical operators (there are no > shift operators) on modular types is problematic in practice? > > The semantics struck me as a bit odd, but I presumed that was academic > since I didn't think anyone actually used them! > > Is it a matter of the implementation burden, or are there practical > drawbacks too? I see you referred to AI-340 earlier, is that what you are referring to? http://www.ada-auth.org/cgi-bin/cvsweb.cgi/ais/ai-00340.txt?rev=1.8 - Brian -- This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean.Received on Fri Jul 11 10:25:11 2014
This archive was generated by hypermail 2.1.8 : Fri Jul 11 2014 - 10:25:23 PDT