User loginNavigation 
Extensible tuples?I've been mulling over a language design issue which would be nicely solved if tuples behaved like a monoid. Is anyone aware of a language where tuples can be arbitrarily extended? For example, if # is the tuple extension operator: f :: a > b > a#b f x y = x # y f 1 "dog" ==> (1,"dog") f (1,"dog") true ==> (1,"dog",true) f () ("dog", true) ==> ("dog", true) It seems that type inference is still possible here, though I'm not sure exactly how it would work. (ie, how do you unify types a*b*c and d#e?) By Alex Rubinsteyn at 20081110 05:33  LtU Forum  previous forum topic  next forum topic  other blogs  16921 reads

Browse archivesActive forum topics 
Recent comments
4 days 7 hours ago
5 days 2 hours ago
5 days 6 hours ago
5 days 6 hours ago
5 days 8 hours ago
5 days 8 hours ago
5 days 9 hours ago
5 days 9 hours ago
5 days 13 hours ago
5 days 13 hours ago