On the unification free Prolog programs


Share/Save/Bookmark

Apt, Krzysztof R. and Etalle, Sandro (1993) On the unification free Prolog programs. In: 18th International Symposium on Mathematical Foundations of Computer Science, MFCS 1993, August 30 - September 3, 1993 , Gdansk, Poland (pp. pp. 1-19).

open access
[img]
Preview
PDF
1MB
Abstract: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.
Item Type:Conference or Workshop Item
Copyright:©1993 Springer-Verlag
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/56283
Official URL:http://dx.doi.org/10.1007/3-540-57182-5_1
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page