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  4606 reads

Browse archivesActive forum topics 
Recent comments
19 min 51 sec ago
1 hour 19 min ago
2 hours 45 min ago
2 hours 58 min ago
3 hours 50 min ago
5 hours 25 min ago
7 hours 39 sec ago
7 hours 17 min ago
13 hours 37 min ago
15 hours 34 min ago