User loginNavigation 
Multimap unificationI strongly believe that prologlike unification (programming with holes) should be incorporated in every new programming language. One of my arguments is that unification is more general than pattern matching, and that unification is just as natural as pattern matching. In contrast, I find the unification of two sets hardly intuitive. Set unification is not only nonintuitive but also NP complete. Still, I believe that set unification, as a first class operation, is an interesting programming construct. Actually, I'm more interested in the unification of multimaps because they extend sets. My intuition also tells me that multimap unification can be made more efficient in most usecases. I'm not sure however. Are there any unification 'theorems' that I should consider that counter my intuition? By Robbert van Dalen at 20121219 22:00  LtU Forum  previous forum topic  next forum topic  other blogs  2448 reads

Browse archivesActive forum topics 
Recent comments
3 hours 12 min ago
3 hours 49 min ago
4 hours 8 min ago
4 hours 59 min ago
5 hours 1 min ago
5 hours 3 min ago
5 hours 14 min ago
9 hours 39 min ago
11 hours 14 min ago
14 hours 9 min ago