It appears that a more piecemeal approach, treating only limited classes of
goals,
will prove more useful.
Equivalences
of
Logic
Programs
in
Differing
Languages
Often we wish to regard two programs as equivalent although they may use
different predicate or function symbols. Some transformation systems find it
useful to introduce auxiliary predicates (Tamaki and Sato [1984]), while others
introduce new data structures, that is, new function symbols (Hansson and
Tarnlund [1980]).
One of the simplest ways to define equivalence on programs written within
different languages is to use the standard definition ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.