In the last few years, substantial efforts have been made towards developing equational programming languages and logic programming languages: the so-called descriptive languages. The languages of both types are based on mathematical systems and to a certain extent resemble each other. This is a clue to the possibility of program transformation from one type to the other. An equational language concerns algebraic specifications of abstract data types and recursive program schemes. Thus, the transformation may introduce the notions of data abstraction and computation strategies into logic programming languages. In this paper, we propose a transformation algorithm that transforms equational programs into logic programs. For our purpose, we have extended the programming language PROLOG, which has been widely cited in related literature as a promising language, to a logic programming language based on a new computation model. We have shown that the algorithm transforms any equational program into an equal or more powerful logic program. For a recursive equational program, there exists a Horn program with equivalent computational power. © 1987.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below