User loginNavigation 
foundations for J, APL etci have been playing around with Haskell, and finding ADTs a little *choke* restrictive. it seems every evaluation has to be done in the order of creation. i am wondering if there is a nonfunctional approach to patternmatching that can handle abstract operations on arrays and other complex data structures. i am thinking in the direction of APL, but more a language where the APL primitives can be built from scratch. from a scan of his pubs, Barry Jay's pattern calculus might be a good fit. maybe i can do this with Haskell and just don't realise? perhaps 'active patterns' will save me? Alix By shoe at 20071129 12:13  LtU Forum  previous forum topic  next forum topic  other blogs  7709 reads

Browse archivesActive forum topics 
Recent comments
9 hours 45 min ago
10 hours 3 min ago
10 hours 7 min ago
2 days 6 hours ago
2 days 16 hours ago
2 days 23 hours ago
2 days 23 hours ago
3 days 7 hours ago
3 days 7 hours ago
3 days 10 hours ago