User loginNavigation 
Optimal efficiencyReading about Constraint Handling Rules, there is a claim that CHR is the first declarative language for which optimum efficiency of implementing all algorithms can be proved, and that this cannot be proved for the pure part of logic (eg Prolog), rewriting (eg Maude), or functional programming (eg Haskell), without adding imperative features. Should we all be trying to develop languages based on CHR, rather than functional? What other language types to proofs (or disproofs) exist for optimal efficiency? By Keean Schupke at 20151001 08:35  LtU Forum  previous forum topic  next forum topic  other blogs  4340 reads

Browse archivesActive forum topics 
Recent comments
3 days 21 hours ago
1 week 5 days ago
2 weeks 5 hours ago
2 weeks 5 hours ago
2 weeks 5 hours ago
2 weeks 6 hours ago
2 weeks 6 hours ago
2 weeks 8 hours ago
2 weeks 12 hours ago
2 weeks 14 hours ago