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 2015-10-01 08:35 | LtU Forum | previous forum topic | next forum topic | other blogs | 5968 reads
|
Browse archivesActive forum topics |
Recent comments
1 week 6 days ago
1 week 6 days ago
2 weeks 6 days ago
3 weeks 13 hours ago
3 weeks 17 hours ago
3 weeks 17 hours ago
3 weeks 17 hours ago
3 weeks 6 days ago
3 weeks 6 days ago
4 weeks 3 hours ago