User loginNavigation |
archivesOptimal 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? |
Browse archivesActive forum topics |
Recent comments
1 week 1 day ago
1 week 1 day ago
1 week 1 day ago
23 weeks 3 days ago
27 weeks 4 days ago
29 weeks 2 days ago
29 weeks 2 days ago
32 weeks 21 min ago
36 weeks 4 days ago
36 weeks 4 days ago