Given Scala 3's first-class syntax for extension methods, is the complexity of right-associative operators still warranted? Could similar ergonomics be achieved without the magic associativity rule based on a colon in the name? def (x: T) :: (xs: List[T]): List[T] = ::(x, xs)
-
-
I'm writing an APL implementation and added another 5 layers of right association today in my uncommitted branch :-( Plenty moar where this lot came from ;-)pic.twitter.com/ABphh5EOyU
-
Bearing in mind I know absolutely zero APL, are those... precedence weightings?
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.