Nadia Nedjah, Luiza de Macedo Mourelle. Improving Space, Time, and Termination in Rewriting-Based Programming. In László Monostori, József Váncza, Moonis Ali, editors, Engineering of Intelligent Systems, 14th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2001, Budapest, Hungary, June 4-7, 2001, Proceedings. Volume 2070 of Lecture Notes in Computer Science, pages 880-890, Springer, 2001. [doi]
Pattern-matching is a fundamental feature in many applications such as logic programming [5], [13], theorem proving [4], term rewriting and rule- based expert systems [3]. Usually, patterns size is not constrained and ambiguous patterns are allowed. This generality leads to a clear and concise programming style. However, it yields challenging problems in the compilation of such programming languages. In this work, we deal with such problems in order to improve time and space requirements of pattern-matching as well as termination properties of term evaluation.