User loginNavigation |
archivesExtensible 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?) OVERNITE ACM ICPC 2009 MULTI PROVINCIAL PROGRAMMING CONTESTIIT Kharagpur KSHITIJ 2009 THE ANNUAL TECHNO-MANAGEMENT FEST 29th Jan- 1st Feb * C/C++/JAVA to be used as medium of coding. OPENSOFT What would you call a body without soul? Moreover this event is open source, thus enabling later modifications, JAVAWISE Open Source Java is the missing piece of the puzzle to enable broader The event challenges the participants to develop an application to be ìMouse4D Introduces the latest innovation in the field of Robotics,the It requires the competitors to face the challenge in a virtual HACKED?...If you have the fire to combat the e-world this is a FramED9211...Ever wondered how they nab those over-speeding vehicles? www.ktj.in |
Browse archivesActive forum topics |
Recent comments
22 weeks 2 days ago
22 weeks 2 days ago
22 weeks 2 days ago
44 weeks 3 days ago
48 weeks 5 days ago
50 weeks 3 days ago
50 weeks 3 days ago
1 year 6 days ago
1 year 5 weeks ago
1 year 5 weeks ago