  The possibility of translating logic programs into functional ones has long
been a subject of investigation. Common to the many approaches is that the
original logic program, in order to be translated, needs to be well-moded and
this has led to the common understanding that these programs can be considered
to be the ``functional part'' of logic programs. As a consequence of this it
has become widely accepted that ``complex'' logical variables, the possibility
of a dynamic selection rule, and general properties of non-well-moded programs
are exclusive features of logic programs. This is not quite true, as some of
these features are naturally found in lazy functional languages. We readdress
the old question of what features are exclusive to the logic programming
paradigm by defining a simple translation applicable to a wider range of logic
programs, and demonstrate that the current circumscription is unreasonably
restrictive.
