We provide simple conditions which allow us to conclude that in case of several well-known Prolog programs the unification algorithm can be replaced by iterated matching. The main tools used here are types and generic expressions for types. As already noticed by other researchers, such a replacement offers a possibility of improving the efficiency of program’s execution.
CITATION STYLE
Apt, K. R., & Etalle, S. (1993). On the unification free prolog programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 711 LNCS, pp. 1–19). Springer Verlag. https://doi.org/10.1007/3-540-57182-5_1
Mendeley helps you to discover research relevant for your work.