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.
|Number of pages||19|
|Publication status||Published - Aug 1993|
|Event||18th International Symposium on Mathematical Foundations of Computer Science, MFCS 1993 - Gdansk, Poland|
Duration: 30 Aug 1993 → 3 Sep 1993
|Conference||18th International Symposium on Mathematical Foundations of Computer Science, MFCS 1993|
|Period||30/08/93 → 3/09/93|
|Other||August 30 - September 3, 1993|