🚀 go-pugleaf

In article <INFO-M2%90072611375987@UCF1VM.BITNET> Modula2 List <INFO-M2%UCF1VM.BITNET@jade.berkeley.edu> writes:

>Nope, but I like to see that too (with uniary/binary operations,
>commutative and precedence control on both new and existing types,
>and generic type determinable parameters to procedures and static vars,
>and variable width bit fields and *optional* garbage collection and
>stardard bit ordering access and exception handling and ....)

You don't want much I guess.  Try Ada maybe, or Clu, Russell, ML, ...

More to the point, try to define a language with all that stuff.
Then try to implement it.  Then try to use it.
*I* certainly don't want to maintain programs that redefine
precedence of existing operators.  The other features sound
(more or less) ok when considered alone; building a complete language
that has all the neat features you like is hard work.
Of course, people DO work on these things all the time.
The results are often interesting and exciting.  

On the other hand, one of the attractions of Modula-2 (and Oberon) is the
minimalism.  These are languages I can hope to understand, in toto.

Regarding all the bit field stuff, I often use bitsets for
such things.

-- 
Preston Briggs				looking for the great leap forward
preston@titan.rice.edu