Affiliation:
1. K.U.Leuven, Heverlee, Belgium
Abstract
Constraint Handling Rules (CHR) is a high-level rule-based programming language which is increasingly used for general-purpose programming. We introduce the CHR machine, a model of computation based on the operational semantics of CHR. Its computational power and time complexity properties are compared to those of the well-understood Turing machine and Random Access Memory machine. This allows us to prove the interesting result that every algorithm can be implemented in CHR with the best known time and space complexity. We also investigate the practical relevance of this result and the constant factors involved. Finally we expand the scope of the discussion to other (declarative) programming languages.
Publisher
Association for Computing Machinery (ACM)
Reference48 articles.
1. An algorithm for the organization of information;Adelson-Velsky G. M.;Doklady Akademii Nauk SSSR,1962
2. Aho A. V. Hopcroft J. E. and Ullman J. D. 1975. The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Boston. Aho A. V. Hopcroft J. E. and Ullman J. D. 1975. The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Boston.
3. Maude: specification and programming in rewriting logic
4. Clocksin W. F. and Mellish C. S. 1984. Programming in Prolog. Springer. Clocksin W. F. and Mellish C. S. 1984. Programming in Prolog. Springer.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献