User loginNavigation 
archivesMultimap 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? 
Browse archivesActive forum topics
New forum topics

Recent comments
1 day 6 hours ago
1 day 16 hours ago
2 days 2 hours ago
2 days 5 hours ago
2 days 5 hours ago
2 days 9 hours ago
2 days 13 hours ago
2 days 13 hours ago
2 days 18 hours ago
2 days 18 hours ago